/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 05:16:34,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:16:34,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:16:34,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:16:34,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:16:34,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:16:34,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:16:34,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:16:34,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:16:34,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:16:34,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:16:34,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:16:34,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:16:34,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:16:34,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:16:34,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:16:34,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:16:34,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:16:34,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:16:34,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:16:34,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:16:34,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:16:34,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:16:34,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:16:34,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:16:34,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:16:34,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:16:34,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:16:34,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:16:34,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:16:34,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:16:34,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:16:34,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:16:34,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:16:34,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:16:34,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:16:34,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:16:34,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:16:34,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:16:34,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:16:34,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:16:34,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 05:16:34,523 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:16:34,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:16:34,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:16:34,525 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:16:34,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:16:34,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:16:34,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:16:34,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:16:34,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:16:34,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:16:34,526 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:16:34,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:16:34,527 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:16:34,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:16:34,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:16:34,527 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:16:34,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:16:34,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:16:34,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:16:34,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:16:34,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:16:34,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:16:34,529 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 05:16:34,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:16:34,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:16:34,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:16:34,809 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:16:34,810 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:16:34,810 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-07-18 05:16:34,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c6c54b8/a657c15304bb4c2b822789a85ffd058d/FLAG6de461df8 [2020-07-18 05:16:35,440 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:16:35,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-07-18 05:16:35,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c6c54b8/a657c15304bb4c2b822789a85ffd058d/FLAG6de461df8 [2020-07-18 05:16:35,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3c6c54b8/a657c15304bb4c2b822789a85ffd058d [2020-07-18 05:16:35,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:16:35,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:16:35,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:16:35,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:16:35,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:16:35,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:16:35" (1/1) ... [2020-07-18 05:16:35,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28772d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:35, skipping insertion in model container [2020-07-18 05:16:35,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:16:35" (1/1) ... [2020-07-18 05:16:35,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:16:35,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:16:36,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:16:36,266 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:16:36,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:16:36,399 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:16:36,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36 WrapperNode [2020-07-18 05:16:36,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:16:36,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:16:36,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:16:36,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:16:36,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (1/1) ... [2020-07-18 05:16:36,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (1/1) ... [2020-07-18 05:16:36,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (1/1) ... [2020-07-18 05:16:36,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (1/1) ... [2020-07-18 05:16:36,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (1/1) ... [2020-07-18 05:16:36,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (1/1) ... [2020-07-18 05:16:36,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (1/1) ... [2020-07-18 05:16:36,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:16:36,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:16:36,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:16:36,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:16:36,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (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-18 05:16:36,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:16:36,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:16:36,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-18 05:16:36,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-18 05:16:36,544 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-18 05:16:36,545 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-07-18 05:16:36,545 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-07-18 05:16:36,545 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-07-18 05:16:36,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:16:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:16:36,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:16:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-18 05:16:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-18 05:16:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 05:16:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 05:16:36,546 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 05:16:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 05:16:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 05:16:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 05:16:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 05:16:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 05:16:36,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 05:16:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 05:16:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 05:16:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 05:16:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 05:16:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 05:16:36,548 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 05:16:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 05:16:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 05:16:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 05:16:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 05:16:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 05:16:36,549 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 05:16:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 05:16:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 05:16:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 05:16:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 05:16:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 05:16:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 05:16:36,550 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 05:16:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 05:16:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 05:16:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 05:16:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 05:16:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 05:16:36,551 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 05:16:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 05:16:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 05:16:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 05:16:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 05:16:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 05:16:36,552 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 05:16:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 05:16:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 05:16:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 05:16:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 05:16:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 05:16:36,553 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 05:16:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 05:16:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 05:16:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 05:16:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 05:16:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 05:16:36,554 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 05:16:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 05:16:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 05:16:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 05:16:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 05:16:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 05:16:36,555 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 05:16:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 05:16:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 05:16:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 05:16:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 05:16:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 05:16:36,556 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 05:16:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 05:16:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 05:16:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 05:16:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 05:16:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 05:16:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 05:16:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 05:16:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 05:16:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 05:16:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 05:16:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 05:16:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 05:16:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 05:16:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 05:16:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 05:16:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 05:16:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 05:16:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 05:16:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 05:16:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 05:16:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 05:16:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 05:16:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 05:16:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 05:16:36,560 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 05:16:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 05:16:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 05:16:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 05:16:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 05:16:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 05:16:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 05:16:36,561 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 05:16:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 05:16:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 05:16:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 05:16:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 05:16:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 05:16:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 05:16:36,562 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 05:16:36,563 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-18 05:16:36,563 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-07-18 05:16:36,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 05:16:36,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 05:16:36,563 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-07-18 05:16:36,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 05:16:36,564 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-07-18 05:16:36,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 05:16:36,564 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:16:36,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:16:36,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:16:36,936 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-18 05:16:37,208 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:16:37,208 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 05:16:37,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:16:37 BoogieIcfgContainer [2020-07-18 05:16:37,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:16:37,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:16:37,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:16:37,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:16:37,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:16:35" (1/3) ... [2020-07-18 05:16:37,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492390a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:16:37, skipping insertion in model container [2020-07-18 05:16:37,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:16:36" (2/3) ... [2020-07-18 05:16:37,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492390a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:16:37, skipping insertion in model container [2020-07-18 05:16:37,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:16:37" (3/3) ... [2020-07-18 05:16:37,222 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2020-07-18 05:16:37,234 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:16:37,244 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 05:16:37,259 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 05:16:37,284 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:16:37,284 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:16:37,285 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:16:37,285 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:16:37,285 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:16:37,285 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:16:37,286 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:16:37,286 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:16:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2020-07-18 05:16:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 05:16:37,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:37,319 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] [2020-07-18 05:16:37,319 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1731717969, now seen corresponding path program 1 times [2020-07-18 05:16:37,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:37,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075330387] [2020-07-18 05:16:37,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:37,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {78#true} is VALID [2020-07-18 05:16:37,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} #valid := #valid[0 := 0]; {78#true} is VALID [2020-07-18 05:16:37,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume 0 < #StackHeapBarrier; {78#true} is VALID [2020-07-18 05:16:37,561 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-18 05:16:37,562 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {78#true} {78#true} #147#return; {78#true} is VALID [2020-07-18 05:16:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:37,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {98#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {78#true} is VALID [2020-07-18 05:16:37,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} ~head~0.base, ~head~0.offset := 0, 0; {78#true} is VALID [2020-07-18 05:16:37,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume !(~len > 0); {78#true} is VALID [2020-07-18 05:16:37,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {78#true} is VALID [2020-07-18 05:16:37,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-18 05:16:37,602 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {79#false} #141#return; {79#false} is VALID [2020-07-18 05:16:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:37,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {78#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {78#true} is VALID [2020-07-18 05:16:37,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {78#true} ~len~0 := 0; {78#true} is VALID [2020-07-18 05:16:37,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} assume !(~head.base != 0 || ~head.offset != 0); {78#true} is VALID [2020-07-18 05:16:37,617 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} #res := ~len~0; {78#true} is VALID [2020-07-18 05:16:37,617 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-18 05:16:37,617 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {79#false} #143#return; {79#false} is VALID [2020-07-18 05:16:37,619 INFO L263 TraceCheckUtils]: 0: Hoare triple {78#true} call ULTIMATE.init(); {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:37,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {78#true} is VALID [2020-07-18 05:16:37,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {78#true} #valid := #valid[0 := 0]; {78#true} is VALID [2020-07-18 05:16:37,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {78#true} assume 0 < #StackHeapBarrier; {78#true} is VALID [2020-07-18 05:16:37,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-18 05:16:37,621 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {78#true} {78#true} #147#return; {78#true} is VALID [2020-07-18 05:16:37,621 INFO L263 TraceCheckUtils]: 6: Hoare triple {78#true} call #t~ret12 := main(); {78#true} is VALID [2020-07-18 05:16:37,622 INFO L280 TraceCheckUtils]: 7: Hoare triple {78#true} ~len~1 := 2; {78#true} is VALID [2020-07-18 05:16:37,623 INFO L280 TraceCheckUtils]: 8: Hoare triple {78#true} assume !true; {79#false} is VALID [2020-07-18 05:16:37,623 INFO L263 TraceCheckUtils]: 9: Hoare triple {79#false} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {98#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:37,623 INFO L280 TraceCheckUtils]: 10: Hoare triple {98#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {78#true} is VALID [2020-07-18 05:16:37,624 INFO L280 TraceCheckUtils]: 11: Hoare triple {78#true} ~head~0.base, ~head~0.offset := 0, 0; {78#true} is VALID [2020-07-18 05:16:37,624 INFO L280 TraceCheckUtils]: 12: Hoare triple {78#true} assume !(~len > 0); {78#true} is VALID [2020-07-18 05:16:37,624 INFO L280 TraceCheckUtils]: 13: Hoare triple {78#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {78#true} is VALID [2020-07-18 05:16:37,625 INFO L280 TraceCheckUtils]: 14: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-18 05:16:37,625 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {78#true} {79#false} #141#return; {79#false} is VALID [2020-07-18 05:16:37,625 INFO L280 TraceCheckUtils]: 16: Hoare triple {79#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {79#false} is VALID [2020-07-18 05:16:37,626 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#false} havoc #t~ret10.base, #t~ret10.offset; {79#false} is VALID [2020-07-18 05:16:37,626 INFO L263 TraceCheckUtils]: 18: Hoare triple {79#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {78#true} is VALID [2020-07-18 05:16:37,626 INFO L280 TraceCheckUtils]: 19: Hoare triple {78#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {78#true} is VALID [2020-07-18 05:16:37,626 INFO L280 TraceCheckUtils]: 20: Hoare triple {78#true} ~len~0 := 0; {78#true} is VALID [2020-07-18 05:16:37,627 INFO L280 TraceCheckUtils]: 21: Hoare triple {78#true} assume !(~head.base != 0 || ~head.offset != 0); {78#true} is VALID [2020-07-18 05:16:37,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {78#true} #res := ~len~0; {78#true} is VALID [2020-07-18 05:16:37,627 INFO L280 TraceCheckUtils]: 23: Hoare triple {78#true} assume true; {78#true} is VALID [2020-07-18 05:16:37,628 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {78#true} {79#false} #143#return; {79#false} is VALID [2020-07-18 05:16:37,628 INFO L280 TraceCheckUtils]: 25: Hoare triple {79#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {79#false} is VALID [2020-07-18 05:16:37,628 INFO L280 TraceCheckUtils]: 26: Hoare triple {79#false} assume ~len~1 != #t~ret11; {79#false} is VALID [2020-07-18 05:16:37,629 INFO L280 TraceCheckUtils]: 27: Hoare triple {79#false} havoc #t~ret11; {79#false} is VALID [2020-07-18 05:16:37,629 INFO L280 TraceCheckUtils]: 28: Hoare triple {79#false} assume !false; {79#false} is VALID [2020-07-18 05:16:37,634 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-18 05:16:37,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075330387] [2020-07-18 05:16:37,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:16:37,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 05:16:37,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16466450] [2020-07-18 05:16:37,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-18 05:16:37,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:37,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 05:16:37,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:37,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 05:16:37,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 05:16:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 05:16:37,715 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2020-07-18 05:16:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:38,552 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2020-07-18 05:16:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 05:16:38,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-18 05:16:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:16:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2020-07-18 05:16:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 05:16:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2020-07-18 05:16:38,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2020-07-18 05:16:38,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:38,886 INFO L225 Difference]: With dead ends: 154 [2020-07-18 05:16:38,886 INFO L226 Difference]: Without dead ends: 68 [2020-07-18 05:16:38,893 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 05:16:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-18 05:16:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2020-07-18 05:16:39,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:39,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 55 states. [2020-07-18 05:16:39,027 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 55 states. [2020-07-18 05:16:39,027 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 55 states. [2020-07-18 05:16:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:39,039 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-18 05:16:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-18 05:16:39,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:39,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:39,042 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 68 states. [2020-07-18 05:16:39,042 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 68 states. [2020-07-18 05:16:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:39,055 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-18 05:16:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-18 05:16:39,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:39,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:39,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:39,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-18 05:16:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-18 05:16:39,065 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 29 [2020-07-18 05:16:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:39,065 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-18 05:16:39,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 05:16:39,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2020-07-18 05:16:39,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-18 05:16:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 05:16:39,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:39,151 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-18 05:16:39,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:16:39,152 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash 632987872, now seen corresponding path program 1 times [2020-07-18 05:16:39,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:39,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [686625546] [2020-07-18 05:16:39,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:39,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {679#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {658#true} is VALID [2020-07-18 05:16:39,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} #valid := #valid[0 := 0]; {658#true} is VALID [2020-07-18 05:16:39,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume 0 < #StackHeapBarrier; {658#true} is VALID [2020-07-18 05:16:39,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-18 05:16:39,267 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {658#true} {658#true} #147#return; {658#true} is VALID [2020-07-18 05:16:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:39,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {680#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {658#true} is VALID [2020-07-18 05:16:39,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} ~head~0.base, ~head~0.offset := 0, 0; {658#true} is VALID [2020-07-18 05:16:39,301 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume !(~len > 0); {658#true} is VALID [2020-07-18 05:16:39,302 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {658#true} is VALID [2020-07-18 05:16:39,302 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-18 05:16:39,302 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {659#false} #141#return; {659#false} is VALID [2020-07-18 05:16:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:39,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {658#true} is VALID [2020-07-18 05:16:39,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {658#true} ~len~0 := 0; {658#true} is VALID [2020-07-18 05:16:39,312 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} assume !(~head.base != 0 || ~head.offset != 0); {658#true} is VALID [2020-07-18 05:16:39,312 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} #res := ~len~0; {658#true} is VALID [2020-07-18 05:16:39,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-18 05:16:39,313 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {659#false} #143#return; {659#false} is VALID [2020-07-18 05:16:39,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {658#true} call ULTIMATE.init(); {679#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:39,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {658#true} is VALID [2020-07-18 05:16:39,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {658#true} #valid := #valid[0 := 0]; {658#true} is VALID [2020-07-18 05:16:39,315 INFO L280 TraceCheckUtils]: 3: Hoare triple {658#true} assume 0 < #StackHeapBarrier; {658#true} is VALID [2020-07-18 05:16:39,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-18 05:16:39,316 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {658#true} {658#true} #147#return; {658#true} is VALID [2020-07-18 05:16:39,316 INFO L263 TraceCheckUtils]: 6: Hoare triple {658#true} call #t~ret12 := main(); {658#true} is VALID [2020-07-18 05:16:39,317 INFO L280 TraceCheckUtils]: 7: Hoare triple {658#true} ~len~1 := 2; {665#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:39,318 INFO L280 TraceCheckUtils]: 8: Hoare triple {665#(<= main_~len~1 2)} #t~short8 := ~len~1 < 32; {666#|main_#t~short8|} is VALID [2020-07-18 05:16:39,319 INFO L280 TraceCheckUtils]: 9: Hoare triple {666#|main_#t~short8|} assume !#t~short8; {659#false} is VALID [2020-07-18 05:16:39,319 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#false} assume !#t~short8; {659#false} is VALID [2020-07-18 05:16:39,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {659#false} havoc #t~short8; {659#false} is VALID [2020-07-18 05:16:39,320 INFO L280 TraceCheckUtils]: 12: Hoare triple {659#false} havoc #t~nondet7; {659#false} is VALID [2020-07-18 05:16:39,320 INFO L263 TraceCheckUtils]: 13: Hoare triple {659#false} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {680#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:39,320 INFO L280 TraceCheckUtils]: 14: Hoare triple {680#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {658#true} is VALID [2020-07-18 05:16:39,320 INFO L280 TraceCheckUtils]: 15: Hoare triple {658#true} ~head~0.base, ~head~0.offset := 0, 0; {658#true} is VALID [2020-07-18 05:16:39,321 INFO L280 TraceCheckUtils]: 16: Hoare triple {658#true} assume !(~len > 0); {658#true} is VALID [2020-07-18 05:16:39,321 INFO L280 TraceCheckUtils]: 17: Hoare triple {658#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {658#true} is VALID [2020-07-18 05:16:39,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-18 05:16:39,321 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {658#true} {659#false} #141#return; {659#false} is VALID [2020-07-18 05:16:39,322 INFO L280 TraceCheckUtils]: 20: Hoare triple {659#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {659#false} is VALID [2020-07-18 05:16:39,322 INFO L280 TraceCheckUtils]: 21: Hoare triple {659#false} havoc #t~ret10.base, #t~ret10.offset; {659#false} is VALID [2020-07-18 05:16:39,322 INFO L263 TraceCheckUtils]: 22: Hoare triple {659#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {658#true} is VALID [2020-07-18 05:16:39,323 INFO L280 TraceCheckUtils]: 23: Hoare triple {658#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {658#true} is VALID [2020-07-18 05:16:39,323 INFO L280 TraceCheckUtils]: 24: Hoare triple {658#true} ~len~0 := 0; {658#true} is VALID [2020-07-18 05:16:39,323 INFO L280 TraceCheckUtils]: 25: Hoare triple {658#true} assume !(~head.base != 0 || ~head.offset != 0); {658#true} is VALID [2020-07-18 05:16:39,323 INFO L280 TraceCheckUtils]: 26: Hoare triple {658#true} #res := ~len~0; {658#true} is VALID [2020-07-18 05:16:39,324 INFO L280 TraceCheckUtils]: 27: Hoare triple {658#true} assume true; {658#true} is VALID [2020-07-18 05:16:39,324 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {658#true} {659#false} #143#return; {659#false} is VALID [2020-07-18 05:16:39,324 INFO L280 TraceCheckUtils]: 29: Hoare triple {659#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {659#false} is VALID [2020-07-18 05:16:39,325 INFO L280 TraceCheckUtils]: 30: Hoare triple {659#false} assume ~len~1 != #t~ret11; {659#false} is VALID [2020-07-18 05:16:39,325 INFO L280 TraceCheckUtils]: 31: Hoare triple {659#false} havoc #t~ret11; {659#false} is VALID [2020-07-18 05:16:39,325 INFO L280 TraceCheckUtils]: 32: Hoare triple {659#false} assume !false; {659#false} is VALID [2020-07-18 05:16:39,329 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-18 05:16:39,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [686625546] [2020-07-18 05:16:39,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:16:39,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 05:16:39,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418458878] [2020-07-18 05:16:39,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-18 05:16:39,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:39,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 05:16:39,366 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-18 05:16:39,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 05:16:39,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 05:16:39,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 05:16:39,368 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 6 states. [2020-07-18 05:16:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:40,320 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2020-07-18 05:16:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 05:16:40,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-18 05:16:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 05:16:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2020-07-18 05:16:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 05:16:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2020-07-18 05:16:40,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 154 transitions. [2020-07-18 05:16:40,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:40,528 INFO L225 Difference]: With dead ends: 143 [2020-07-18 05:16:40,528 INFO L226 Difference]: Without dead ends: 96 [2020-07-18 05:16:40,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-18 05:16:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-18 05:16:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2020-07-18 05:16:40,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:40,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 57 states. [2020-07-18 05:16:40,637 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 57 states. [2020-07-18 05:16:40,637 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 57 states. [2020-07-18 05:16:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:40,650 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-18 05:16:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-18 05:16:40,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:40,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:40,653 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 96 states. [2020-07-18 05:16:40,653 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 96 states. [2020-07-18 05:16:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:40,659 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-18 05:16:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-18 05:16:40,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:40,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:40,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:40,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-18 05:16:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-07-18 05:16:40,664 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 33 [2020-07-18 05:16:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:40,665 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-07-18 05:16:40,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 05:16:40,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2020-07-18 05:16:40,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-07-18 05:16:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 05:16:40,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:40,750 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] [2020-07-18 05:16:40,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:16:40,750 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:40,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1134974621, now seen corresponding path program 1 times [2020-07-18 05:16:40,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:40,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [729909751] [2020-07-18 05:16:40,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:40,851 INFO L280 TraceCheckUtils]: 0: Hoare triple {1304#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1284#true} is VALID [2020-07-18 05:16:40,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} #valid := #valid[0 := 0]; {1284#true} is VALID [2020-07-18 05:16:40,852 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} assume 0 < #StackHeapBarrier; {1284#true} is VALID [2020-07-18 05:16:40,853 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-18 05:16:40,853 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1284#true} {1284#true} #147#return; {1284#true} is VALID [2020-07-18 05:16:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:40,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {1305#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1306#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:40,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {1306#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {1306#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:40,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {1306#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:40,979 INFO L280 TraceCheckUtils]: 3: Hoare triple {1307#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:40,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {1307#(<= |sll_create_#in~len| 0)} assume true; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:40,983 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1307#(<= |sll_create_#in~len| 0)} {1291#(<= 2 main_~len~1)} #141#return; {1285#false} is VALID [2020-07-18 05:16:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:40,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {1284#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1284#true} is VALID [2020-07-18 05:16:40,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} ~len~0 := 0; {1284#true} is VALID [2020-07-18 05:16:40,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} assume !(~head.base != 0 || ~head.offset != 0); {1284#true} is VALID [2020-07-18 05:16:40,998 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} #res := ~len~0; {1284#true} is VALID [2020-07-18 05:16:40,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-18 05:16:40,999 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1284#true} {1285#false} #143#return; {1285#false} is VALID [2020-07-18 05:16:41,000 INFO L263 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1304#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:41,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {1304#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1284#true} is VALID [2020-07-18 05:16:41,001 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} #valid := #valid[0 := 0]; {1284#true} is VALID [2020-07-18 05:16:41,001 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} assume 0 < #StackHeapBarrier; {1284#true} is VALID [2020-07-18 05:16:41,001 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-18 05:16:41,002 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1284#true} {1284#true} #147#return; {1284#true} is VALID [2020-07-18 05:16:41,002 INFO L263 TraceCheckUtils]: 6: Hoare triple {1284#true} call #t~ret12 := main(); {1284#true} is VALID [2020-07-18 05:16:41,004 INFO L280 TraceCheckUtils]: 7: Hoare triple {1284#true} ~len~1 := 2; {1291#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:41,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {1291#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {1291#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:41,021 INFO L280 TraceCheckUtils]: 9: Hoare triple {1291#(<= 2 main_~len~1)} assume #t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:41,022 INFO L280 TraceCheckUtils]: 10: Hoare triple {1291#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1291#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:41,023 INFO L280 TraceCheckUtils]: 11: Hoare triple {1291#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {1291#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:41,023 INFO L280 TraceCheckUtils]: 12: Hoare triple {1291#(<= 2 main_~len~1)} assume !#t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:41,027 INFO L280 TraceCheckUtils]: 13: Hoare triple {1291#(<= 2 main_~len~1)} havoc #t~short8; {1291#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:41,028 INFO L280 TraceCheckUtils]: 14: Hoare triple {1291#(<= 2 main_~len~1)} havoc #t~nondet7; {1291#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:41,032 INFO L263 TraceCheckUtils]: 15: Hoare triple {1291#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1305#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:41,033 INFO L280 TraceCheckUtils]: 16: Hoare triple {1305#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1306#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:41,034 INFO L280 TraceCheckUtils]: 17: Hoare triple {1306#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {1306#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:41,035 INFO L280 TraceCheckUtils]: 18: Hoare triple {1306#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:41,035 INFO L280 TraceCheckUtils]: 19: Hoare triple {1307#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:41,036 INFO L280 TraceCheckUtils]: 20: Hoare triple {1307#(<= |sll_create_#in~len| 0)} assume true; {1307#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:41,038 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1307#(<= |sll_create_#in~len| 0)} {1291#(<= 2 main_~len~1)} #141#return; {1285#false} is VALID [2020-07-18 05:16:41,038 INFO L280 TraceCheckUtils]: 22: Hoare triple {1285#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {1285#false} is VALID [2020-07-18 05:16:41,038 INFO L280 TraceCheckUtils]: 23: Hoare triple {1285#false} havoc #t~ret10.base, #t~ret10.offset; {1285#false} is VALID [2020-07-18 05:16:41,039 INFO L263 TraceCheckUtils]: 24: Hoare triple {1285#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1284#true} is VALID [2020-07-18 05:16:41,039 INFO L280 TraceCheckUtils]: 25: Hoare triple {1284#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1284#true} is VALID [2020-07-18 05:16:41,039 INFO L280 TraceCheckUtils]: 26: Hoare triple {1284#true} ~len~0 := 0; {1284#true} is VALID [2020-07-18 05:16:41,039 INFO L280 TraceCheckUtils]: 27: Hoare triple {1284#true} assume !(~head.base != 0 || ~head.offset != 0); {1284#true} is VALID [2020-07-18 05:16:41,040 INFO L280 TraceCheckUtils]: 28: Hoare triple {1284#true} #res := ~len~0; {1284#true} is VALID [2020-07-18 05:16:41,040 INFO L280 TraceCheckUtils]: 29: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-18 05:16:41,040 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1284#true} {1285#false} #143#return; {1285#false} is VALID [2020-07-18 05:16:41,040 INFO L280 TraceCheckUtils]: 31: Hoare triple {1285#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1285#false} is VALID [2020-07-18 05:16:41,041 INFO L280 TraceCheckUtils]: 32: Hoare triple {1285#false} assume ~len~1 != #t~ret11; {1285#false} is VALID [2020-07-18 05:16:41,041 INFO L280 TraceCheckUtils]: 33: Hoare triple {1285#false} havoc #t~ret11; {1285#false} is VALID [2020-07-18 05:16:41,041 INFO L280 TraceCheckUtils]: 34: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2020-07-18 05:16:41,045 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-18 05:16:41,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [729909751] [2020-07-18 05:16:41,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:16:41,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 05:16:41,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705285777] [2020-07-18 05:16:41,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-18 05:16:41,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:41,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 05:16:41,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:41,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 05:16:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 05:16:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 05:16:41,090 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 7 states. [2020-07-18 05:16:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:42,058 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2020-07-18 05:16:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 05:16:42,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-18 05:16:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 05:16:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2020-07-18 05:16:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 05:16:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2020-07-18 05:16:42,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 121 transitions. [2020-07-18 05:16:42,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:42,237 INFO L225 Difference]: With dead ends: 114 [2020-07-18 05:16:42,237 INFO L226 Difference]: Without dead ends: 94 [2020-07-18 05:16:42,238 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-18 05:16:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-07-18 05:16:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2020-07-18 05:16:42,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:42,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 67 states. [2020-07-18 05:16:42,350 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 67 states. [2020-07-18 05:16:42,350 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 67 states. [2020-07-18 05:16:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:42,355 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-18 05:16:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-18 05:16:42,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:42,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:42,357 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 94 states. [2020-07-18 05:16:42,357 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 94 states. [2020-07-18 05:16:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:42,362 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2020-07-18 05:16:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-18 05:16:42,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:42,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:42,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:42,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-18 05:16:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2020-07-18 05:16:42,367 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 35 [2020-07-18 05:16:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:42,367 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2020-07-18 05:16:42,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 05:16:42,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 73 transitions. [2020-07-18 05:16:42,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2020-07-18 05:16:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 05:16:42,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:42,486 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] [2020-07-18 05:16:42,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:16:42,487 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash 226602169, now seen corresponding path program 1 times [2020-07-18 05:16:42,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:42,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1906681922] [2020-07-18 05:16:42,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:42,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1869#true} is VALID [2020-07-18 05:16:42,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} #valid := #valid[0 := 0]; {1869#true} is VALID [2020-07-18 05:16:42,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume 0 < #StackHeapBarrier; {1869#true} is VALID [2020-07-18 05:16:42,569 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-18 05:16:42,570 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1869#true} {1869#true} #147#return; {1869#true} is VALID [2020-07-18 05:16:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:42,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {1893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1869#true} is VALID [2020-07-18 05:16:42,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} ~head~0.base, ~head~0.offset := 0, 0; {1869#true} is VALID [2020-07-18 05:16:42,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume !(~len > 0); {1869#true} is VALID [2020-07-18 05:16:42,599 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1869#true} is VALID [2020-07-18 05:16:42,599 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-18 05:16:42,599 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1870#false} #141#return; {1870#false} is VALID [2020-07-18 05:16:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:42,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {1869#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1869#true} is VALID [2020-07-18 05:16:42,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {1869#true} ~len~0 := 0; {1869#true} is VALID [2020-07-18 05:16:42,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} assume !(~head.base != 0 || ~head.offset != 0); {1869#true} is VALID [2020-07-18 05:16:42,611 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} #res := ~len~0; {1869#true} is VALID [2020-07-18 05:16:42,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-18 05:16:42,612 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1870#false} #143#return; {1870#false} is VALID [2020-07-18 05:16:42,613 INFO L263 TraceCheckUtils]: 0: Hoare triple {1869#true} call ULTIMATE.init(); {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:42,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {1892#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1869#true} is VALID [2020-07-18 05:16:42,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {1869#true} #valid := #valid[0 := 0]; {1869#true} is VALID [2020-07-18 05:16:42,613 INFO L280 TraceCheckUtils]: 3: Hoare triple {1869#true} assume 0 < #StackHeapBarrier; {1869#true} is VALID [2020-07-18 05:16:42,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-18 05:16:42,614 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1869#true} {1869#true} #147#return; {1869#true} is VALID [2020-07-18 05:16:42,614 INFO L263 TraceCheckUtils]: 6: Hoare triple {1869#true} call #t~ret12 := main(); {1869#true} is VALID [2020-07-18 05:16:42,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {1869#true} ~len~1 := 2; {1876#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:42,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {1876#(<= main_~len~1 2)} #t~short8 := ~len~1 < 32; {1876#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:42,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {1876#(<= main_~len~1 2)} assume #t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:42,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {1876#(<= main_~len~1 2)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1876#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:42,616 INFO L280 TraceCheckUtils]: 11: Hoare triple {1876#(<= main_~len~1 2)} #t~short8 := 0 != #t~nondet7; {1876#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:42,616 INFO L280 TraceCheckUtils]: 12: Hoare triple {1876#(<= main_~len~1 2)} assume !!#t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:42,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {1876#(<= main_~len~1 2)} havoc #t~short8; {1876#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:42,617 INFO L280 TraceCheckUtils]: 14: Hoare triple {1876#(<= main_~len~1 2)} havoc #t~nondet7; {1876#(<= main_~len~1 2)} is VALID [2020-07-18 05:16:42,618 INFO L280 TraceCheckUtils]: 15: Hoare triple {1876#(<= main_~len~1 2)} #t~post9 := ~len~1; {1877#(<= |main_#t~post9| 2)} is VALID [2020-07-18 05:16:42,619 INFO L280 TraceCheckUtils]: 16: Hoare triple {1877#(<= |main_#t~post9| 2)} ~len~1 := 1 + #t~post9; {1878#(<= main_~len~1 3)} is VALID [2020-07-18 05:16:42,622 INFO L280 TraceCheckUtils]: 17: Hoare triple {1878#(<= main_~len~1 3)} havoc #t~post9; {1878#(<= main_~len~1 3)} is VALID [2020-07-18 05:16:42,623 INFO L280 TraceCheckUtils]: 18: Hoare triple {1878#(<= main_~len~1 3)} #t~short8 := ~len~1 < 32; {1879#|main_#t~short8|} is VALID [2020-07-18 05:16:42,623 INFO L280 TraceCheckUtils]: 19: Hoare triple {1879#|main_#t~short8|} assume !#t~short8; {1870#false} is VALID [2020-07-18 05:16:42,624 INFO L280 TraceCheckUtils]: 20: Hoare triple {1870#false} assume !#t~short8; {1870#false} is VALID [2020-07-18 05:16:42,624 INFO L280 TraceCheckUtils]: 21: Hoare triple {1870#false} havoc #t~short8; {1870#false} is VALID [2020-07-18 05:16:42,624 INFO L280 TraceCheckUtils]: 22: Hoare triple {1870#false} havoc #t~nondet7; {1870#false} is VALID [2020-07-18 05:16:42,624 INFO L263 TraceCheckUtils]: 23: Hoare triple {1870#false} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:42,625 INFO L280 TraceCheckUtils]: 24: Hoare triple {1893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {1869#true} is VALID [2020-07-18 05:16:42,625 INFO L280 TraceCheckUtils]: 25: Hoare triple {1869#true} ~head~0.base, ~head~0.offset := 0, 0; {1869#true} is VALID [2020-07-18 05:16:42,625 INFO L280 TraceCheckUtils]: 26: Hoare triple {1869#true} assume !(~len > 0); {1869#true} is VALID [2020-07-18 05:16:42,625 INFO L280 TraceCheckUtils]: 27: Hoare triple {1869#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1869#true} is VALID [2020-07-18 05:16:42,626 INFO L280 TraceCheckUtils]: 28: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-18 05:16:42,626 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1869#true} {1870#false} #141#return; {1870#false} is VALID [2020-07-18 05:16:42,626 INFO L280 TraceCheckUtils]: 30: Hoare triple {1870#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {1870#false} is VALID [2020-07-18 05:16:42,626 INFO L280 TraceCheckUtils]: 31: Hoare triple {1870#false} havoc #t~ret10.base, #t~ret10.offset; {1870#false} is VALID [2020-07-18 05:16:42,627 INFO L263 TraceCheckUtils]: 32: Hoare triple {1870#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1869#true} is VALID [2020-07-18 05:16:42,627 INFO L280 TraceCheckUtils]: 33: Hoare triple {1869#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {1869#true} is VALID [2020-07-18 05:16:42,627 INFO L280 TraceCheckUtils]: 34: Hoare triple {1869#true} ~len~0 := 0; {1869#true} is VALID [2020-07-18 05:16:42,627 INFO L280 TraceCheckUtils]: 35: Hoare triple {1869#true} assume !(~head.base != 0 || ~head.offset != 0); {1869#true} is VALID [2020-07-18 05:16:42,627 INFO L280 TraceCheckUtils]: 36: Hoare triple {1869#true} #res := ~len~0; {1869#true} is VALID [2020-07-18 05:16:42,628 INFO L280 TraceCheckUtils]: 37: Hoare triple {1869#true} assume true; {1869#true} is VALID [2020-07-18 05:16:42,628 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1869#true} {1870#false} #143#return; {1870#false} is VALID [2020-07-18 05:16:42,628 INFO L280 TraceCheckUtils]: 39: Hoare triple {1870#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1870#false} is VALID [2020-07-18 05:16:42,628 INFO L280 TraceCheckUtils]: 40: Hoare triple {1870#false} assume ~len~1 != #t~ret11; {1870#false} is VALID [2020-07-18 05:16:42,629 INFO L280 TraceCheckUtils]: 41: Hoare triple {1870#false} havoc #t~ret11; {1870#false} is VALID [2020-07-18 05:16:42,629 INFO L280 TraceCheckUtils]: 42: Hoare triple {1870#false} assume !false; {1870#false} is VALID [2020-07-18 05:16:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:16:42,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1906681922] [2020-07-18 05:16:42,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:16:42,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 05:16:42,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462704547] [2020-07-18 05:16:42,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-07-18 05:16:42,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:42,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 05:16:42,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:42,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 05:16:42,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 05:16:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 05:16:42,697 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2020-07-18 05:16:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:44,101 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2020-07-18 05:16:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 05:16:44,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-07-18 05:16:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 05:16:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2020-07-18 05:16:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 05:16:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2020-07-18 05:16:44,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2020-07-18 05:16:44,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:44,341 INFO L225 Difference]: With dead ends: 168 [2020-07-18 05:16:44,341 INFO L226 Difference]: Without dead ends: 117 [2020-07-18 05:16:44,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-18 05:16:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-18 05:16:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2020-07-18 05:16:44,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:44,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 74 states. [2020-07-18 05:16:44,484 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 74 states. [2020-07-18 05:16:44,484 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 74 states. [2020-07-18 05:16:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:44,489 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-18 05:16:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-18 05:16:44,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:44,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:44,490 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 117 states. [2020-07-18 05:16:44,491 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 117 states. [2020-07-18 05:16:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:44,501 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2020-07-18 05:16:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2020-07-18 05:16:44,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:44,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:44,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:44,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-18 05:16:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2020-07-18 05:16:44,506 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 43 [2020-07-18 05:16:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:44,507 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2020-07-18 05:16:44,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 05:16:44,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 80 transitions. [2020-07-18 05:16:44,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2020-07-18 05:16:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-18 05:16:44,628 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:44,628 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:16:44,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 05:16:44,628 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 360366586, now seen corresponding path program 1 times [2020-07-18 05:16:44,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:44,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [428589563] [2020-07-18 05:16:44,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:44,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {2661#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2631#true} is VALID [2020-07-18 05:16:44,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {2631#true} #valid := #valid[0 := 0]; {2631#true} is VALID [2020-07-18 05:16:44,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} assume 0 < #StackHeapBarrier; {2631#true} is VALID [2020-07-18 05:16:44,740 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#true} assume true; {2631#true} is VALID [2020-07-18 05:16:44,741 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2631#true} {2631#true} #147#return; {2631#true} is VALID [2020-07-18 05:16:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:44,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {2662#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {2631#true} is VALID [2020-07-18 05:16:44,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {2631#true} ~head~0.base, ~head~0.offset := 0, 0; {2631#true} is VALID [2020-07-18 05:16:44,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} assume !!(~len > 0); {2631#true} is VALID [2020-07-18 05:16:44,845 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {2663#(not (= 0 |sll_create_#t~malloc2.base|))} is VALID [2020-07-18 05:16:44,846 INFO L280 TraceCheckUtils]: 4: Hoare triple {2663#(not (= 0 |sll_create_#t~malloc2.base|))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:44,847 INFO L280 TraceCheckUtils]: 5: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:44,847 INFO L280 TraceCheckUtils]: 6: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:44,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,848 INFO L280 TraceCheckUtils]: 8: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} #t~post3 := ~len; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,848 INFO L280 TraceCheckUtils]: 9: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} ~len := #t~post3 - 1; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,849 INFO L280 TraceCheckUtils]: 10: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} havoc #t~post3; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,850 INFO L280 TraceCheckUtils]: 12: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2666#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-18 05:16:44,850 INFO L280 TraceCheckUtils]: 13: Hoare triple {2666#(not (= 0 |sll_create_#res.base|))} assume true; {2666#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-18 05:16:44,851 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2666#(not (= 0 |sll_create_#res.base|))} {2631#true} #141#return; {2653#(not (= 0 |main_#t~ret10.base|))} is VALID [2020-07-18 05:16:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:44,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {2631#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-18 05:16:44,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} ~len~0 := 0; {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-18 05:16:44,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-18 05:16:44,896 INFO L280 TraceCheckUtils]: 3: Hoare triple {2668#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-18 05:16:44,896 INFO L280 TraceCheckUtils]: 4: Hoare triple {2668#(= 0 |sll_length_#in~head.base|)} assume true; {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-18 05:16:44,897 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2668#(= 0 |sll_length_#in~head.base|)} {2654#(not (= 0 main_~s~0.base))} #143#return; {2632#false} is VALID [2020-07-18 05:16:44,898 INFO L263 TraceCheckUtils]: 0: Hoare triple {2631#true} call ULTIMATE.init(); {2661#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:44,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {2661#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2631#true} is VALID [2020-07-18 05:16:44,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {2631#true} #valid := #valid[0 := 0]; {2631#true} is VALID [2020-07-18 05:16:44,899 INFO L280 TraceCheckUtils]: 3: Hoare triple {2631#true} assume 0 < #StackHeapBarrier; {2631#true} is VALID [2020-07-18 05:16:44,899 INFO L280 TraceCheckUtils]: 4: Hoare triple {2631#true} assume true; {2631#true} is VALID [2020-07-18 05:16:44,899 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2631#true} {2631#true} #147#return; {2631#true} is VALID [2020-07-18 05:16:44,900 INFO L263 TraceCheckUtils]: 6: Hoare triple {2631#true} call #t~ret12 := main(); {2631#true} is VALID [2020-07-18 05:16:44,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {2631#true} ~len~1 := 2; {2631#true} is VALID [2020-07-18 05:16:44,900 INFO L280 TraceCheckUtils]: 8: Hoare triple {2631#true} #t~short8 := ~len~1 < 32; {2631#true} is VALID [2020-07-18 05:16:44,900 INFO L280 TraceCheckUtils]: 9: Hoare triple {2631#true} assume #t~short8; {2631#true} is VALID [2020-07-18 05:16:44,901 INFO L280 TraceCheckUtils]: 10: Hoare triple {2631#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2631#true} is VALID [2020-07-18 05:16:44,901 INFO L280 TraceCheckUtils]: 11: Hoare triple {2631#true} #t~short8 := 0 != #t~nondet7; {2631#true} is VALID [2020-07-18 05:16:44,901 INFO L280 TraceCheckUtils]: 12: Hoare triple {2631#true} assume !#t~short8; {2631#true} is VALID [2020-07-18 05:16:44,901 INFO L280 TraceCheckUtils]: 13: Hoare triple {2631#true} havoc #t~short8; {2631#true} is VALID [2020-07-18 05:16:44,902 INFO L280 TraceCheckUtils]: 14: Hoare triple {2631#true} havoc #t~nondet7; {2631#true} is VALID [2020-07-18 05:16:44,903 INFO L263 TraceCheckUtils]: 15: Hoare triple {2631#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {2662#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:44,903 INFO L280 TraceCheckUtils]: 16: Hoare triple {2662#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {2631#true} is VALID [2020-07-18 05:16:44,904 INFO L280 TraceCheckUtils]: 17: Hoare triple {2631#true} ~head~0.base, ~head~0.offset := 0, 0; {2631#true} is VALID [2020-07-18 05:16:44,904 INFO L280 TraceCheckUtils]: 18: Hoare triple {2631#true} assume !!(~len > 0); {2631#true} is VALID [2020-07-18 05:16:44,905 INFO L280 TraceCheckUtils]: 19: Hoare triple {2631#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {2663#(not (= 0 |sll_create_#t~malloc2.base|))} is VALID [2020-07-18 05:16:44,909 INFO L280 TraceCheckUtils]: 20: Hoare triple {2663#(not (= 0 |sll_create_#t~malloc2.base|))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:44,911 INFO L280 TraceCheckUtils]: 21: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:44,913 INFO L280 TraceCheckUtils]: 22: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {2664#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:44,914 INFO L280 TraceCheckUtils]: 23: Hoare triple {2664#(not (= 0 sll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,914 INFO L280 TraceCheckUtils]: 24: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} #t~post3 := ~len; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,915 INFO L280 TraceCheckUtils]: 25: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} ~len := #t~post3 - 1; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,924 INFO L280 TraceCheckUtils]: 26: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} havoc #t~post3; {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,926 INFO L280 TraceCheckUtils]: 27: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {2665#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:44,926 INFO L280 TraceCheckUtils]: 28: Hoare triple {2665#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2666#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-18 05:16:44,927 INFO L280 TraceCheckUtils]: 29: Hoare triple {2666#(not (= 0 |sll_create_#res.base|))} assume true; {2666#(not (= 0 |sll_create_#res.base|))} is VALID [2020-07-18 05:16:44,928 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2666#(not (= 0 |sll_create_#res.base|))} {2631#true} #141#return; {2653#(not (= 0 |main_#t~ret10.base|))} is VALID [2020-07-18 05:16:44,929 INFO L280 TraceCheckUtils]: 31: Hoare triple {2653#(not (= 0 |main_#t~ret10.base|))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {2654#(not (= 0 main_~s~0.base))} is VALID [2020-07-18 05:16:44,930 INFO L280 TraceCheckUtils]: 32: Hoare triple {2654#(not (= 0 main_~s~0.base))} havoc #t~ret10.base, #t~ret10.offset; {2654#(not (= 0 main_~s~0.base))} is VALID [2020-07-18 05:16:44,930 INFO L263 TraceCheckUtils]: 33: Hoare triple {2654#(not (= 0 main_~s~0.base))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {2631#true} is VALID [2020-07-18 05:16:44,931 INFO L280 TraceCheckUtils]: 34: Hoare triple {2631#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-18 05:16:44,931 INFO L280 TraceCheckUtils]: 35: Hoare triple {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} ~len~0 := 0; {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2020-07-18 05:16:44,932 INFO L280 TraceCheckUtils]: 36: Hoare triple {2667#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-18 05:16:44,933 INFO L280 TraceCheckUtils]: 37: Hoare triple {2668#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-18 05:16:44,933 INFO L280 TraceCheckUtils]: 38: Hoare triple {2668#(= 0 |sll_length_#in~head.base|)} assume true; {2668#(= 0 |sll_length_#in~head.base|)} is VALID [2020-07-18 05:16:44,934 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2668#(= 0 |sll_length_#in~head.base|)} {2654#(not (= 0 main_~s~0.base))} #143#return; {2632#false} is VALID [2020-07-18 05:16:44,935 INFO L280 TraceCheckUtils]: 40: Hoare triple {2632#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {2632#false} is VALID [2020-07-18 05:16:44,935 INFO L280 TraceCheckUtils]: 41: Hoare triple {2632#false} assume ~len~1 != #t~ret11; {2632#false} is VALID [2020-07-18 05:16:44,935 INFO L280 TraceCheckUtils]: 42: Hoare triple {2632#false} havoc #t~ret11; {2632#false} is VALID [2020-07-18 05:16:44,935 INFO L280 TraceCheckUtils]: 43: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2020-07-18 05:16:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:16:44,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [428589563] [2020-07-18 05:16:44,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:16:44,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 05:16:44,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145279030] [2020-07-18 05:16:44,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-07-18 05:16:44,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:44,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 05:16:44,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:44,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 05:16:44,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:44,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 05:16:44,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-18 05:16:44,986 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 12 states. [2020-07-18 05:16:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:46,775 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2020-07-18 05:16:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 05:16:46,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2020-07-18 05:16:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 05:16:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2020-07-18 05:16:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 05:16:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 91 transitions. [2020-07-18 05:16:46,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 91 transitions. [2020-07-18 05:16:46,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:46,904 INFO L225 Difference]: With dead ends: 101 [2020-07-18 05:16:46,904 INFO L226 Difference]: Without dead ends: 96 [2020-07-18 05:16:46,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-07-18 05:16:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-18 05:16:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2020-07-18 05:16:47,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:47,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 81 states. [2020-07-18 05:16:47,125 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 81 states. [2020-07-18 05:16:47,125 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 81 states. [2020-07-18 05:16:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:47,130 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-18 05:16:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-18 05:16:47,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:47,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:47,131 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 96 states. [2020-07-18 05:16:47,131 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 96 states. [2020-07-18 05:16:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:47,135 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2020-07-18 05:16:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2020-07-18 05:16:47,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:47,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:47,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:47,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-18 05:16:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-18 05:16:47,140 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 44 [2020-07-18 05:16:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:47,141 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-18 05:16:47,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 05:16:47,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 89 transitions. [2020-07-18 05:16:47,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-18 05:16:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-18 05:16:47,286 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:47,286 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2020-07-18 05:16:47,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 05:16:47,287 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -829611268, now seen corresponding path program 1 times [2020-07-18 05:16:47,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:47,288 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1353903342] [2020-07-18 05:16:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:47,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {3265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3243#true} is VALID [2020-07-18 05:16:47,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {3243#true} #valid := #valid[0 := 0]; {3243#true} is VALID [2020-07-18 05:16:47,390 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} assume 0 < #StackHeapBarrier; {3243#true} is VALID [2020-07-18 05:16:47,390 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-18 05:16:47,391 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3243#true} {3243#true} #147#return; {3243#true} is VALID [2020-07-18 05:16:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:47,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {3266#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {3267#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:47,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {3267#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {3267#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:47,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {3267#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:47,447 INFO L280 TraceCheckUtils]: 3: Hoare triple {3268#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:47,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {3268#(<= |sll_create_#in~len| 0)} assume true; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:47,449 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3268#(<= |sll_create_#in~len| 0)} {3252#(<= 3 main_~len~1)} #141#return; {3244#false} is VALID [2020-07-18 05:16:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:47,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {3243#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3243#true} is VALID [2020-07-18 05:16:47,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {3243#true} ~len~0 := 0; {3243#true} is VALID [2020-07-18 05:16:47,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} assume !(~head.base != 0 || ~head.offset != 0); {3243#true} is VALID [2020-07-18 05:16:47,457 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} #res := ~len~0; {3243#true} is VALID [2020-07-18 05:16:47,457 INFO L280 TraceCheckUtils]: 4: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-18 05:16:47,457 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3243#true} {3244#false} #143#return; {3244#false} is VALID [2020-07-18 05:16:47,458 INFO L263 TraceCheckUtils]: 0: Hoare triple {3243#true} call ULTIMATE.init(); {3265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:47,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {3265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3243#true} is VALID [2020-07-18 05:16:47,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {3243#true} #valid := #valid[0 := 0]; {3243#true} is VALID [2020-07-18 05:16:47,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {3243#true} assume 0 < #StackHeapBarrier; {3243#true} is VALID [2020-07-18 05:16:47,459 INFO L280 TraceCheckUtils]: 4: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-18 05:16:47,459 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3243#true} {3243#true} #147#return; {3243#true} is VALID [2020-07-18 05:16:47,459 INFO L263 TraceCheckUtils]: 6: Hoare triple {3243#true} call #t~ret12 := main(); {3243#true} is VALID [2020-07-18 05:16:47,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {3243#true} ~len~1 := 2; {3250#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:47,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {3250#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {3250#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:47,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {3250#(<= 2 main_~len~1)} assume #t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:47,460 INFO L280 TraceCheckUtils]: 10: Hoare triple {3250#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3250#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:47,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {3250#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {3250#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:47,461 INFO L280 TraceCheckUtils]: 12: Hoare triple {3250#(<= 2 main_~len~1)} assume !!#t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:47,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {3250#(<= 2 main_~len~1)} havoc #t~short8; {3250#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:47,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {3250#(<= 2 main_~len~1)} havoc #t~nondet7; {3250#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:47,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {3250#(<= 2 main_~len~1)} #t~post9 := ~len~1; {3251#(<= 2 |main_#t~post9|)} is VALID [2020-07-18 05:16:47,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {3251#(<= 2 |main_#t~post9|)} ~len~1 := 1 + #t~post9; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~post9; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {3252#(<= 3 main_~len~1)} #t~short8 := ~len~1 < 32; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {3252#(<= 3 main_~len~1)} assume #t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,465 INFO L280 TraceCheckUtils]: 20: Hoare triple {3252#(<= 3 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,469 INFO L280 TraceCheckUtils]: 21: Hoare triple {3252#(<= 3 main_~len~1)} #t~short8 := 0 != #t~nondet7; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,471 INFO L280 TraceCheckUtils]: 22: Hoare triple {3252#(<= 3 main_~len~1)} assume !#t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,471 INFO L280 TraceCheckUtils]: 23: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~short8; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,472 INFO L280 TraceCheckUtils]: 24: Hoare triple {3252#(<= 3 main_~len~1)} havoc #t~nondet7; {3252#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:47,472 INFO L263 TraceCheckUtils]: 25: Hoare triple {3252#(<= 3 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {3266#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:47,473 INFO L280 TraceCheckUtils]: 26: Hoare triple {3266#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {3267#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:47,473 INFO L280 TraceCheckUtils]: 27: Hoare triple {3267#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {3267#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:47,474 INFO L280 TraceCheckUtils]: 28: Hoare triple {3267#(= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:47,474 INFO L280 TraceCheckUtils]: 29: Hoare triple {3268#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:47,474 INFO L280 TraceCheckUtils]: 30: Hoare triple {3268#(<= |sll_create_#in~len| 0)} assume true; {3268#(<= |sll_create_#in~len| 0)} is VALID [2020-07-18 05:16:47,475 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3268#(<= |sll_create_#in~len| 0)} {3252#(<= 3 main_~len~1)} #141#return; {3244#false} is VALID [2020-07-18 05:16:47,475 INFO L280 TraceCheckUtils]: 32: Hoare triple {3244#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {3244#false} is VALID [2020-07-18 05:16:47,475 INFO L280 TraceCheckUtils]: 33: Hoare triple {3244#false} havoc #t~ret10.base, #t~ret10.offset; {3244#false} is VALID [2020-07-18 05:16:47,476 INFO L263 TraceCheckUtils]: 34: Hoare triple {3244#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {3243#true} is VALID [2020-07-18 05:16:47,476 INFO L280 TraceCheckUtils]: 35: Hoare triple {3243#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3243#true} is VALID [2020-07-18 05:16:47,476 INFO L280 TraceCheckUtils]: 36: Hoare triple {3243#true} ~len~0 := 0; {3243#true} is VALID [2020-07-18 05:16:47,476 INFO L280 TraceCheckUtils]: 37: Hoare triple {3243#true} assume !(~head.base != 0 || ~head.offset != 0); {3243#true} is VALID [2020-07-18 05:16:47,476 INFO L280 TraceCheckUtils]: 38: Hoare triple {3243#true} #res := ~len~0; {3243#true} is VALID [2020-07-18 05:16:47,476 INFO L280 TraceCheckUtils]: 39: Hoare triple {3243#true} assume true; {3243#true} is VALID [2020-07-18 05:16:47,476 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {3243#true} {3244#false} #143#return; {3244#false} is VALID [2020-07-18 05:16:47,477 INFO L280 TraceCheckUtils]: 41: Hoare triple {3244#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {3244#false} is VALID [2020-07-18 05:16:47,477 INFO L280 TraceCheckUtils]: 42: Hoare triple {3244#false} assume ~len~1 != #t~ret11; {3244#false} is VALID [2020-07-18 05:16:47,477 INFO L280 TraceCheckUtils]: 43: Hoare triple {3244#false} havoc #t~ret11; {3244#false} is VALID [2020-07-18 05:16:47,477 INFO L280 TraceCheckUtils]: 44: Hoare triple {3244#false} assume !false; {3244#false} is VALID [2020-07-18 05:16:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:16:47,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1353903342] [2020-07-18 05:16:47,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:16:47,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 05:16:47,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963034629] [2020-07-18 05:16:47,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-07-18 05:16:47,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:47,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 05:16:47,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:47,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 05:16:47,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 05:16:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 05:16:47,526 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 9 states. [2020-07-18 05:16:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:48,773 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2020-07-18 05:16:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 05:16:48,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-07-18 05:16:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 05:16:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-18 05:16:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 05:16:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2020-07-18 05:16:48,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2020-07-18 05:16:48,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:48,958 INFO L225 Difference]: With dead ends: 117 [2020-07-18 05:16:48,961 INFO L226 Difference]: Without dead ends: 87 [2020-07-18 05:16:48,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-07-18 05:16:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-18 05:16:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2020-07-18 05:16:49,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:49,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 69 states. [2020-07-18 05:16:49,162 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 69 states. [2020-07-18 05:16:49,162 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 69 states. [2020-07-18 05:16:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:49,165 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2020-07-18 05:16:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2020-07-18 05:16:49,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:49,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:49,166 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 87 states. [2020-07-18 05:16:49,166 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 87 states. [2020-07-18 05:16:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:49,170 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2020-07-18 05:16:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2020-07-18 05:16:49,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:49,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:49,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:49,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-18 05:16:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2020-07-18 05:16:49,173 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 45 [2020-07-18 05:16:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:49,174 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2020-07-18 05:16:49,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 05:16:49,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2020-07-18 05:16:49,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2020-07-18 05:16:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-18 05:16:49,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:49,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:16:49,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 05:16:49,292 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash -642872939, now seen corresponding path program 1 times [2020-07-18 05:16:49,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:49,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1770642808] [2020-07-18 05:16:49,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:49,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {3868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3832#true} is VALID [2020-07-18 05:16:49,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {3832#true} #valid := #valid[0 := 0]; {3832#true} is VALID [2020-07-18 05:16:49,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {3832#true} assume 0 < #StackHeapBarrier; {3832#true} is VALID [2020-07-18 05:16:49,373 INFO L280 TraceCheckUtils]: 3: Hoare triple {3832#true} assume true; {3832#true} is VALID [2020-07-18 05:16:49,374 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3832#true} {3832#true} #147#return; {3832#true} is VALID [2020-07-18 05:16:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:49,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {3869#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,450 INFO L280 TraceCheckUtils]: 4: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,451 INFO L280 TraceCheckUtils]: 5: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,452 INFO L280 TraceCheckUtils]: 7: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,453 INFO L280 TraceCheckUtils]: 8: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {3871#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-18 05:16:49,454 INFO L280 TraceCheckUtils]: 9: Hoare triple {3871#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:49,455 INFO L280 TraceCheckUtils]: 10: Hoare triple {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:49,456 INFO L280 TraceCheckUtils]: 11: Hoare triple {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:49,457 INFO L280 TraceCheckUtils]: 12: Hoare triple {3873#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:49,458 INFO L280 TraceCheckUtils]: 13: Hoare triple {3873#(<= |sll_create_#in~len| 1)} assume true; {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:49,459 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {3873#(<= |sll_create_#in~len| 1)} {3839#(<= 2 main_~len~1)} #141#return; {3833#false} is VALID [2020-07-18 05:16:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:49,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {3832#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3832#true} is VALID [2020-07-18 05:16:49,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {3832#true} ~len~0 := 0; {3832#true} is VALID [2020-07-18 05:16:49,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {3832#true} assume !!(~head.base != 0 || ~head.offset != 0); {3832#true} is VALID [2020-07-18 05:16:49,469 INFO L280 TraceCheckUtils]: 3: Hoare triple {3832#true} #t~post4 := ~len~0; {3832#true} is VALID [2020-07-18 05:16:49,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {3832#true} ~len~0 := 1 + #t~post4; {3832#true} is VALID [2020-07-18 05:16:49,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {3832#true} havoc #t~post4; {3832#true} is VALID [2020-07-18 05:16:49,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {3832#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {3832#true} is VALID [2020-07-18 05:16:49,486 INFO L280 TraceCheckUtils]: 7: Hoare triple {3832#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {3832#true} is VALID [2020-07-18 05:16:49,486 INFO L280 TraceCheckUtils]: 8: Hoare triple {3832#true} havoc #t~mem5.base, #t~mem5.offset; {3832#true} is VALID [2020-07-18 05:16:49,486 INFO L280 TraceCheckUtils]: 9: Hoare triple {3832#true} assume !(~head.base != 0 || ~head.offset != 0); {3832#true} is VALID [2020-07-18 05:16:49,487 INFO L280 TraceCheckUtils]: 10: Hoare triple {3832#true} #res := ~len~0; {3832#true} is VALID [2020-07-18 05:16:49,488 INFO L280 TraceCheckUtils]: 11: Hoare triple {3832#true} assume true; {3832#true} is VALID [2020-07-18 05:16:49,488 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {3832#true} {3833#false} #143#return; {3833#false} is VALID [2020-07-18 05:16:49,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {3832#true} call ULTIMATE.init(); {3868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:49,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {3868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3832#true} is VALID [2020-07-18 05:16:49,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {3832#true} #valid := #valid[0 := 0]; {3832#true} is VALID [2020-07-18 05:16:49,499 INFO L280 TraceCheckUtils]: 3: Hoare triple {3832#true} assume 0 < #StackHeapBarrier; {3832#true} is VALID [2020-07-18 05:16:49,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {3832#true} assume true; {3832#true} is VALID [2020-07-18 05:16:49,500 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3832#true} {3832#true} #147#return; {3832#true} is VALID [2020-07-18 05:16:49,500 INFO L263 TraceCheckUtils]: 6: Hoare triple {3832#true} call #t~ret12 := main(); {3832#true} is VALID [2020-07-18 05:16:49,501 INFO L280 TraceCheckUtils]: 7: Hoare triple {3832#true} ~len~1 := 2; {3839#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:49,502 INFO L280 TraceCheckUtils]: 8: Hoare triple {3839#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {3839#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:49,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {3839#(<= 2 main_~len~1)} assume #t~short8; {3839#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:49,503 INFO L280 TraceCheckUtils]: 10: Hoare triple {3839#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3839#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:49,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {3839#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {3839#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:49,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {3839#(<= 2 main_~len~1)} assume !#t~short8; {3839#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:49,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {3839#(<= 2 main_~len~1)} havoc #t~short8; {3839#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:49,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {3839#(<= 2 main_~len~1)} havoc #t~nondet7; {3839#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:49,509 INFO L263 TraceCheckUtils]: 15: Hoare triple {3839#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {3869#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:49,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {3869#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,513 INFO L280 TraceCheckUtils]: 20: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,514 INFO L280 TraceCheckUtils]: 21: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,515 INFO L280 TraceCheckUtils]: 22: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,516 INFO L280 TraceCheckUtils]: 23: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3870#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:49,520 INFO L280 TraceCheckUtils]: 24: Hoare triple {3870#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {3871#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-18 05:16:49,521 INFO L280 TraceCheckUtils]: 25: Hoare triple {3871#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:49,521 INFO L280 TraceCheckUtils]: 26: Hoare triple {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:49,522 INFO L280 TraceCheckUtils]: 27: Hoare triple {3872#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:49,523 INFO L280 TraceCheckUtils]: 28: Hoare triple {3873#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:49,523 INFO L280 TraceCheckUtils]: 29: Hoare triple {3873#(<= |sll_create_#in~len| 1)} assume true; {3873#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:49,525 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3873#(<= |sll_create_#in~len| 1)} {3839#(<= 2 main_~len~1)} #141#return; {3833#false} is VALID [2020-07-18 05:16:49,526 INFO L280 TraceCheckUtils]: 31: Hoare triple {3833#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {3833#false} is VALID [2020-07-18 05:16:49,526 INFO L280 TraceCheckUtils]: 32: Hoare triple {3833#false} havoc #t~ret10.base, #t~ret10.offset; {3833#false} is VALID [2020-07-18 05:16:49,526 INFO L263 TraceCheckUtils]: 33: Hoare triple {3833#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {3832#true} is VALID [2020-07-18 05:16:49,526 INFO L280 TraceCheckUtils]: 34: Hoare triple {3832#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {3832#true} is VALID [2020-07-18 05:16:49,527 INFO L280 TraceCheckUtils]: 35: Hoare triple {3832#true} ~len~0 := 0; {3832#true} is VALID [2020-07-18 05:16:49,527 INFO L280 TraceCheckUtils]: 36: Hoare triple {3832#true} assume !!(~head.base != 0 || ~head.offset != 0); {3832#true} is VALID [2020-07-18 05:16:49,527 INFO L280 TraceCheckUtils]: 37: Hoare triple {3832#true} #t~post4 := ~len~0; {3832#true} is VALID [2020-07-18 05:16:49,527 INFO L280 TraceCheckUtils]: 38: Hoare triple {3832#true} ~len~0 := 1 + #t~post4; {3832#true} is VALID [2020-07-18 05:16:49,527 INFO L280 TraceCheckUtils]: 39: Hoare triple {3832#true} havoc #t~post4; {3832#true} is VALID [2020-07-18 05:16:49,528 INFO L280 TraceCheckUtils]: 40: Hoare triple {3832#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {3832#true} is VALID [2020-07-18 05:16:49,528 INFO L280 TraceCheckUtils]: 41: Hoare triple {3832#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {3832#true} is VALID [2020-07-18 05:16:49,528 INFO L280 TraceCheckUtils]: 42: Hoare triple {3832#true} havoc #t~mem5.base, #t~mem5.offset; {3832#true} is VALID [2020-07-18 05:16:49,528 INFO L280 TraceCheckUtils]: 43: Hoare triple {3832#true} assume !(~head.base != 0 || ~head.offset != 0); {3832#true} is VALID [2020-07-18 05:16:49,529 INFO L280 TraceCheckUtils]: 44: Hoare triple {3832#true} #res := ~len~0; {3832#true} is VALID [2020-07-18 05:16:49,529 INFO L280 TraceCheckUtils]: 45: Hoare triple {3832#true} assume true; {3832#true} is VALID [2020-07-18 05:16:49,529 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {3832#true} {3833#false} #143#return; {3833#false} is VALID [2020-07-18 05:16:49,529 INFO L280 TraceCheckUtils]: 47: Hoare triple {3833#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {3833#false} is VALID [2020-07-18 05:16:49,529 INFO L280 TraceCheckUtils]: 48: Hoare triple {3833#false} assume ~len~1 != #t~ret11; {3833#false} is VALID [2020-07-18 05:16:49,530 INFO L280 TraceCheckUtils]: 49: Hoare triple {3833#false} havoc #t~ret11; {3833#false} is VALID [2020-07-18 05:16:49,530 INFO L280 TraceCheckUtils]: 50: Hoare triple {3833#false} assume !false; {3833#false} is VALID [2020-07-18 05:16:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 05:16:49,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1770642808] [2020-07-18 05:16:49,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:16:49,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 05:16:49,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402053902] [2020-07-18 05:16:49,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-18 05:16:49,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:49,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 05:16:49,592 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-18 05:16:49,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 05:16:49,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 05:16:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 05:16:49,593 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 9 states. [2020-07-18 05:16:50,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:50,642 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-18 05:16:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 05:16:50,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-18 05:16:50,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 05:16:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2020-07-18 05:16:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 05:16:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2020-07-18 05:16:50,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 122 transitions. [2020-07-18 05:16:50,799 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-18 05:16:50,802 INFO L225 Difference]: With dead ends: 120 [2020-07-18 05:16:50,803 INFO L226 Difference]: Without dead ends: 99 [2020-07-18 05:16:50,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-07-18 05:16:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-18 05:16:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2020-07-18 05:16:51,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:51,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 84 states. [2020-07-18 05:16:51,045 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 84 states. [2020-07-18 05:16:51,045 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 84 states. [2020-07-18 05:16:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:51,050 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-18 05:16:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2020-07-18 05:16:51,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:51,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:51,051 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 99 states. [2020-07-18 05:16:51,051 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 99 states. [2020-07-18 05:16:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:51,054 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-18 05:16:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2020-07-18 05:16:51,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:51,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:51,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:51,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-18 05:16:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2020-07-18 05:16:51,058 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 51 [2020-07-18 05:16:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:51,058 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2020-07-18 05:16:51,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 05:16:51,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 90 transitions. [2020-07-18 05:16:51,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2020-07-18 05:16:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-18 05:16:51,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:51,198 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2020-07-18 05:16:51,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 05:16:51,198 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1372689452, now seen corresponding path program 2 times [2020-07-18 05:16:51,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:51,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2050015311] [2020-07-18 05:16:51,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:51,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {4540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4495#true} is VALID [2020-07-18 05:16:51,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {4495#true} #valid := #valid[0 := 0]; {4495#true} is VALID [2020-07-18 05:16:51,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {4495#true} assume 0 < #StackHeapBarrier; {4495#true} is VALID [2020-07-18 05:16:51,263 INFO L280 TraceCheckUtils]: 3: Hoare triple {4495#true} assume true; {4495#true} is VALID [2020-07-18 05:16:51,263 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4495#true} {4495#true} #147#return; {4495#true} is VALID [2020-07-18 05:16:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:51,367 INFO L280 TraceCheckUtils]: 0: Hoare triple {4541#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,370 INFO L280 TraceCheckUtils]: 5: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,370 INFO L280 TraceCheckUtils]: 6: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,371 INFO L280 TraceCheckUtils]: 7: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {4543#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-18 05:16:51,372 INFO L280 TraceCheckUtils]: 9: Hoare triple {4543#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,372 INFO L280 TraceCheckUtils]: 10: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,373 INFO L280 TraceCheckUtils]: 11: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0); {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,373 INFO L280 TraceCheckUtils]: 12: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,373 INFO L280 TraceCheckUtils]: 13: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,374 INFO L280 TraceCheckUtils]: 15: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,375 INFO L280 TraceCheckUtils]: 16: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,375 INFO L280 TraceCheckUtils]: 17: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post3 := ~len; {4545#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} is VALID [2020-07-18 05:16:51,376 INFO L280 TraceCheckUtils]: 18: Hoare triple {4545#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} ~len := #t~post3 - 1; {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-18 05:16:51,376 INFO L280 TraceCheckUtils]: 19: Hoare triple {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} havoc #t~post3; {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-18 05:16:51,376 INFO L280 TraceCheckUtils]: 20: Hoare triple {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:16:51,377 INFO L280 TraceCheckUtils]: 21: Hoare triple {4547#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:16:51,377 INFO L280 TraceCheckUtils]: 22: Hoare triple {4547#(<= |sll_create_#in~len| 2)} assume true; {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:16:51,378 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {4547#(<= |sll_create_#in~len| 2)} {4502#(<= 2 main_~len~1)} #141#return; {4496#false} is VALID [2020-07-18 05:16:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:51,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {4495#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {4495#true} is VALID [2020-07-18 05:16:51,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {4495#true} ~len~0 := 0; {4495#true} is VALID [2020-07-18 05:16:51,390 INFO L280 TraceCheckUtils]: 2: Hoare triple {4495#true} assume !!(~head.base != 0 || ~head.offset != 0); {4495#true} is VALID [2020-07-18 05:16:51,390 INFO L280 TraceCheckUtils]: 3: Hoare triple {4495#true} #t~post4 := ~len~0; {4495#true} is VALID [2020-07-18 05:16:51,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {4495#true} ~len~0 := 1 + #t~post4; {4495#true} is VALID [2020-07-18 05:16:51,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {4495#true} havoc #t~post4; {4495#true} is VALID [2020-07-18 05:16:51,391 INFO L280 TraceCheckUtils]: 6: Hoare triple {4495#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {4495#true} is VALID [2020-07-18 05:16:51,391 INFO L280 TraceCheckUtils]: 7: Hoare triple {4495#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {4495#true} is VALID [2020-07-18 05:16:51,391 INFO L280 TraceCheckUtils]: 8: Hoare triple {4495#true} havoc #t~mem5.base, #t~mem5.offset; {4495#true} is VALID [2020-07-18 05:16:51,391 INFO L280 TraceCheckUtils]: 9: Hoare triple {4495#true} assume !(~head.base != 0 || ~head.offset != 0); {4495#true} is VALID [2020-07-18 05:16:51,391 INFO L280 TraceCheckUtils]: 10: Hoare triple {4495#true} #res := ~len~0; {4495#true} is VALID [2020-07-18 05:16:51,392 INFO L280 TraceCheckUtils]: 11: Hoare triple {4495#true} assume true; {4495#true} is VALID [2020-07-18 05:16:51,392 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {4495#true} {4496#false} #143#return; {4496#false} is VALID [2020-07-18 05:16:51,393 INFO L263 TraceCheckUtils]: 0: Hoare triple {4495#true} call ULTIMATE.init(); {4540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:51,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {4540#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4495#true} is VALID [2020-07-18 05:16:51,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {4495#true} #valid := #valid[0 := 0]; {4495#true} is VALID [2020-07-18 05:16:51,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {4495#true} assume 0 < #StackHeapBarrier; {4495#true} is VALID [2020-07-18 05:16:51,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {4495#true} assume true; {4495#true} is VALID [2020-07-18 05:16:51,394 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4495#true} {4495#true} #147#return; {4495#true} is VALID [2020-07-18 05:16:51,394 INFO L263 TraceCheckUtils]: 6: Hoare triple {4495#true} call #t~ret12 := main(); {4495#true} is VALID [2020-07-18 05:16:51,395 INFO L280 TraceCheckUtils]: 7: Hoare triple {4495#true} ~len~1 := 2; {4502#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:51,396 INFO L280 TraceCheckUtils]: 8: Hoare triple {4502#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {4502#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:51,396 INFO L280 TraceCheckUtils]: 9: Hoare triple {4502#(<= 2 main_~len~1)} assume #t~short8; {4502#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:51,397 INFO L280 TraceCheckUtils]: 10: Hoare triple {4502#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4502#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:51,397 INFO L280 TraceCheckUtils]: 11: Hoare triple {4502#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {4502#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:51,398 INFO L280 TraceCheckUtils]: 12: Hoare triple {4502#(<= 2 main_~len~1)} assume !#t~short8; {4502#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:51,398 INFO L280 TraceCheckUtils]: 13: Hoare triple {4502#(<= 2 main_~len~1)} havoc #t~short8; {4502#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:51,399 INFO L280 TraceCheckUtils]: 14: Hoare triple {4502#(<= 2 main_~len~1)} havoc #t~nondet7; {4502#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:51,399 INFO L263 TraceCheckUtils]: 15: Hoare triple {4502#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {4541#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:51,400 INFO L280 TraceCheckUtils]: 16: Hoare triple {4541#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,401 INFO L280 TraceCheckUtils]: 17: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,401 INFO L280 TraceCheckUtils]: 18: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,407 INFO L280 TraceCheckUtils]: 19: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,408 INFO L280 TraceCheckUtils]: 20: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,409 INFO L280 TraceCheckUtils]: 21: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,409 INFO L280 TraceCheckUtils]: 22: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,410 INFO L280 TraceCheckUtils]: 23: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4542#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:51,411 INFO L280 TraceCheckUtils]: 24: Hoare triple {4542#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {4543#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-18 05:16:51,412 INFO L280 TraceCheckUtils]: 25: Hoare triple {4543#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,412 INFO L280 TraceCheckUtils]: 26: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,413 INFO L280 TraceCheckUtils]: 27: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0); {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,413 INFO L280 TraceCheckUtils]: 28: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,414 INFO L280 TraceCheckUtils]: 29: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,414 INFO L280 TraceCheckUtils]: 30: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,415 INFO L280 TraceCheckUtils]: 31: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,415 INFO L280 TraceCheckUtils]: 32: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:51,416 INFO L280 TraceCheckUtils]: 33: Hoare triple {4544#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post3 := ~len; {4545#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} is VALID [2020-07-18 05:16:51,417 INFO L280 TraceCheckUtils]: 34: Hoare triple {4545#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} ~len := #t~post3 - 1; {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-18 05:16:51,417 INFO L280 TraceCheckUtils]: 35: Hoare triple {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} havoc #t~post3; {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-18 05:16:51,418 INFO L280 TraceCheckUtils]: 36: Hoare triple {4546#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:16:51,419 INFO L280 TraceCheckUtils]: 37: Hoare triple {4547#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:16:51,419 INFO L280 TraceCheckUtils]: 38: Hoare triple {4547#(<= |sll_create_#in~len| 2)} assume true; {4547#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:16:51,421 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4547#(<= |sll_create_#in~len| 2)} {4502#(<= 2 main_~len~1)} #141#return; {4496#false} is VALID [2020-07-18 05:16:51,421 INFO L280 TraceCheckUtils]: 40: Hoare triple {4496#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {4496#false} is VALID [2020-07-18 05:16:51,421 INFO L280 TraceCheckUtils]: 41: Hoare triple {4496#false} havoc #t~ret10.base, #t~ret10.offset; {4496#false} is VALID [2020-07-18 05:16:51,421 INFO L263 TraceCheckUtils]: 42: Hoare triple {4496#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {4495#true} is VALID [2020-07-18 05:16:51,422 INFO L280 TraceCheckUtils]: 43: Hoare triple {4495#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {4495#true} is VALID [2020-07-18 05:16:51,422 INFO L280 TraceCheckUtils]: 44: Hoare triple {4495#true} ~len~0 := 0; {4495#true} is VALID [2020-07-18 05:16:51,422 INFO L280 TraceCheckUtils]: 45: Hoare triple {4495#true} assume !!(~head.base != 0 || ~head.offset != 0); {4495#true} is VALID [2020-07-18 05:16:51,423 INFO L280 TraceCheckUtils]: 46: Hoare triple {4495#true} #t~post4 := ~len~0; {4495#true} is VALID [2020-07-18 05:16:51,423 INFO L280 TraceCheckUtils]: 47: Hoare triple {4495#true} ~len~0 := 1 + #t~post4; {4495#true} is VALID [2020-07-18 05:16:51,423 INFO L280 TraceCheckUtils]: 48: Hoare triple {4495#true} havoc #t~post4; {4495#true} is VALID [2020-07-18 05:16:51,423 INFO L280 TraceCheckUtils]: 49: Hoare triple {4495#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {4495#true} is VALID [2020-07-18 05:16:51,423 INFO L280 TraceCheckUtils]: 50: Hoare triple {4495#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {4495#true} is VALID [2020-07-18 05:16:51,423 INFO L280 TraceCheckUtils]: 51: Hoare triple {4495#true} havoc #t~mem5.base, #t~mem5.offset; {4495#true} is VALID [2020-07-18 05:16:51,424 INFO L280 TraceCheckUtils]: 52: Hoare triple {4495#true} assume !(~head.base != 0 || ~head.offset != 0); {4495#true} is VALID [2020-07-18 05:16:51,424 INFO L280 TraceCheckUtils]: 53: Hoare triple {4495#true} #res := ~len~0; {4495#true} is VALID [2020-07-18 05:16:51,424 INFO L280 TraceCheckUtils]: 54: Hoare triple {4495#true} assume true; {4495#true} is VALID [2020-07-18 05:16:51,424 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {4495#true} {4496#false} #143#return; {4496#false} is VALID [2020-07-18 05:16:51,424 INFO L280 TraceCheckUtils]: 56: Hoare triple {4496#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {4496#false} is VALID [2020-07-18 05:16:51,425 INFO L280 TraceCheckUtils]: 57: Hoare triple {4496#false} assume ~len~1 != #t~ret11; {4496#false} is VALID [2020-07-18 05:16:51,425 INFO L280 TraceCheckUtils]: 58: Hoare triple {4496#false} havoc #t~ret11; {4496#false} is VALID [2020-07-18 05:16:51,425 INFO L280 TraceCheckUtils]: 59: Hoare triple {4496#false} assume !false; {4496#false} is VALID [2020-07-18 05:16:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 05:16:51,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2050015311] [2020-07-18 05:16:51,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:16:51,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 05:16:51,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060307975] [2020-07-18 05:16:51,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-18 05:16:51,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:51,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 05:16:51,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:51,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 05:16:51,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 05:16:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-18 05:16:51,492 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 11 states. [2020-07-18 05:16:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:52,793 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2020-07-18 05:16:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 05:16:52,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2020-07-18 05:16:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 05:16:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2020-07-18 05:16:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 05:16:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2020-07-18 05:16:52,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 135 transitions. [2020-07-18 05:16:52,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:52,945 INFO L225 Difference]: With dead ends: 132 [2020-07-18 05:16:52,945 INFO L226 Difference]: Without dead ends: 111 [2020-07-18 05:16:52,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-07-18 05:16:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-07-18 05:16:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2020-07-18 05:16:53,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:53,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 93 states. [2020-07-18 05:16:53,197 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 93 states. [2020-07-18 05:16:53,197 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 93 states. [2020-07-18 05:16:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:53,204 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2020-07-18 05:16:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2020-07-18 05:16:53,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:53,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:53,205 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 111 states. [2020-07-18 05:16:53,205 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 111 states. [2020-07-18 05:16:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:53,211 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2020-07-18 05:16:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2020-07-18 05:16:53,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:53,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:53,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:53,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-18 05:16:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2020-07-18 05:16:53,215 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 60 [2020-07-18 05:16:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:53,216 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2020-07-18 05:16:53,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 05:16:53,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 100 transitions. [2020-07-18 05:16:53,398 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-18 05:16:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2020-07-18 05:16:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 05:16:53,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:53,399 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2020-07-18 05:16:53,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 05:16:53,400 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1521110738, now seen corresponding path program 1 times [2020-07-18 05:16:53,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:53,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [110166763] [2020-07-18 05:16:53,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:53,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {5279#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5241#true} is VALID [2020-07-18 05:16:53,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {5241#true} #valid := #valid[0 := 0]; {5241#true} is VALID [2020-07-18 05:16:53,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {5241#true} assume 0 < #StackHeapBarrier; {5241#true} is VALID [2020-07-18 05:16:53,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {5241#true} assume true; {5241#true} is VALID [2020-07-18 05:16:53,488 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5241#true} {5241#true} #147#return; {5241#true} is VALID [2020-07-18 05:16:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:53,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {5280#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,571 INFO L280 TraceCheckUtils]: 3: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,571 INFO L280 TraceCheckUtils]: 4: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,572 INFO L280 TraceCheckUtils]: 5: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,572 INFO L280 TraceCheckUtils]: 6: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,572 INFO L280 TraceCheckUtils]: 7: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,573 INFO L280 TraceCheckUtils]: 8: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {5282#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-18 05:16:53,573 INFO L280 TraceCheckUtils]: 9: Hoare triple {5282#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:53,574 INFO L280 TraceCheckUtils]: 10: Hoare triple {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:53,574 INFO L280 TraceCheckUtils]: 11: Hoare triple {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:53,574 INFO L280 TraceCheckUtils]: 12: Hoare triple {5284#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:53,575 INFO L280 TraceCheckUtils]: 13: Hoare triple {5284#(<= |sll_create_#in~len| 1)} assume true; {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:53,576 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {5284#(<= |sll_create_#in~len| 1)} {5250#(<= 3 main_~len~1)} #141#return; {5242#false} is VALID [2020-07-18 05:16:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:53,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {5241#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {5241#true} is VALID [2020-07-18 05:16:53,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {5241#true} ~len~0 := 0; {5241#true} is VALID [2020-07-18 05:16:53,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {5241#true} assume !!(~head.base != 0 || ~head.offset != 0); {5241#true} is VALID [2020-07-18 05:16:53,584 INFO L280 TraceCheckUtils]: 3: Hoare triple {5241#true} #t~post4 := ~len~0; {5241#true} is VALID [2020-07-18 05:16:53,584 INFO L280 TraceCheckUtils]: 4: Hoare triple {5241#true} ~len~0 := 1 + #t~post4; {5241#true} is VALID [2020-07-18 05:16:53,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {5241#true} havoc #t~post4; {5241#true} is VALID [2020-07-18 05:16:53,585 INFO L280 TraceCheckUtils]: 6: Hoare triple {5241#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {5241#true} is VALID [2020-07-18 05:16:53,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {5241#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {5241#true} is VALID [2020-07-18 05:16:53,585 INFO L280 TraceCheckUtils]: 8: Hoare triple {5241#true} havoc #t~mem5.base, #t~mem5.offset; {5241#true} is VALID [2020-07-18 05:16:53,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {5241#true} assume !(~head.base != 0 || ~head.offset != 0); {5241#true} is VALID [2020-07-18 05:16:53,585 INFO L280 TraceCheckUtils]: 10: Hoare triple {5241#true} #res := ~len~0; {5241#true} is VALID [2020-07-18 05:16:53,585 INFO L280 TraceCheckUtils]: 11: Hoare triple {5241#true} assume true; {5241#true} is VALID [2020-07-18 05:16:53,586 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5241#true} {5242#false} #143#return; {5242#false} is VALID [2020-07-18 05:16:53,586 INFO L263 TraceCheckUtils]: 0: Hoare triple {5241#true} call ULTIMATE.init(); {5279#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:53,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {5279#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5241#true} is VALID [2020-07-18 05:16:53,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {5241#true} #valid := #valid[0 := 0]; {5241#true} is VALID [2020-07-18 05:16:53,587 INFO L280 TraceCheckUtils]: 3: Hoare triple {5241#true} assume 0 < #StackHeapBarrier; {5241#true} is VALID [2020-07-18 05:16:53,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {5241#true} assume true; {5241#true} is VALID [2020-07-18 05:16:53,587 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5241#true} {5241#true} #147#return; {5241#true} is VALID [2020-07-18 05:16:53,587 INFO L263 TraceCheckUtils]: 6: Hoare triple {5241#true} call #t~ret12 := main(); {5241#true} is VALID [2020-07-18 05:16:53,587 INFO L280 TraceCheckUtils]: 7: Hoare triple {5241#true} ~len~1 := 2; {5248#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:53,588 INFO L280 TraceCheckUtils]: 8: Hoare triple {5248#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {5248#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:53,588 INFO L280 TraceCheckUtils]: 9: Hoare triple {5248#(<= 2 main_~len~1)} assume #t~short8; {5248#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:53,588 INFO L280 TraceCheckUtils]: 10: Hoare triple {5248#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5248#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:53,589 INFO L280 TraceCheckUtils]: 11: Hoare triple {5248#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {5248#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:53,589 INFO L280 TraceCheckUtils]: 12: Hoare triple {5248#(<= 2 main_~len~1)} assume !!#t~short8; {5248#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:53,590 INFO L280 TraceCheckUtils]: 13: Hoare triple {5248#(<= 2 main_~len~1)} havoc #t~short8; {5248#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:53,590 INFO L280 TraceCheckUtils]: 14: Hoare triple {5248#(<= 2 main_~len~1)} havoc #t~nondet7; {5248#(<= 2 main_~len~1)} is VALID [2020-07-18 05:16:53,590 INFO L280 TraceCheckUtils]: 15: Hoare triple {5248#(<= 2 main_~len~1)} #t~post9 := ~len~1; {5249#(<= 2 |main_#t~post9|)} is VALID [2020-07-18 05:16:53,591 INFO L280 TraceCheckUtils]: 16: Hoare triple {5249#(<= 2 |main_#t~post9|)} ~len~1 := 1 + #t~post9; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,591 INFO L280 TraceCheckUtils]: 17: Hoare triple {5250#(<= 3 main_~len~1)} havoc #t~post9; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,592 INFO L280 TraceCheckUtils]: 18: Hoare triple {5250#(<= 3 main_~len~1)} #t~short8 := ~len~1 < 32; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,592 INFO L280 TraceCheckUtils]: 19: Hoare triple {5250#(<= 3 main_~len~1)} assume #t~short8; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,592 INFO L280 TraceCheckUtils]: 20: Hoare triple {5250#(<= 3 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,593 INFO L280 TraceCheckUtils]: 21: Hoare triple {5250#(<= 3 main_~len~1)} #t~short8 := 0 != #t~nondet7; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,593 INFO L280 TraceCheckUtils]: 22: Hoare triple {5250#(<= 3 main_~len~1)} assume !#t~short8; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,593 INFO L280 TraceCheckUtils]: 23: Hoare triple {5250#(<= 3 main_~len~1)} havoc #t~short8; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,594 INFO L280 TraceCheckUtils]: 24: Hoare triple {5250#(<= 3 main_~len~1)} havoc #t~nondet7; {5250#(<= 3 main_~len~1)} is VALID [2020-07-18 05:16:53,594 INFO L263 TraceCheckUtils]: 25: Hoare triple {5250#(<= 3 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {5280#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:53,595 INFO L280 TraceCheckUtils]: 26: Hoare triple {5280#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,595 INFO L280 TraceCheckUtils]: 27: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,596 INFO L280 TraceCheckUtils]: 28: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,598 INFO L280 TraceCheckUtils]: 29: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,599 INFO L280 TraceCheckUtils]: 30: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,600 INFO L280 TraceCheckUtils]: 31: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,600 INFO L280 TraceCheckUtils]: 32: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,600 INFO L280 TraceCheckUtils]: 33: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5281#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:16:53,601 INFO L280 TraceCheckUtils]: 34: Hoare triple {5281#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {5282#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-18 05:16:53,601 INFO L280 TraceCheckUtils]: 35: Hoare triple {5282#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:53,602 INFO L280 TraceCheckUtils]: 36: Hoare triple {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:16:53,602 INFO L280 TraceCheckUtils]: 37: Hoare triple {5283#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:53,603 INFO L280 TraceCheckUtils]: 38: Hoare triple {5284#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:53,603 INFO L280 TraceCheckUtils]: 39: Hoare triple {5284#(<= |sll_create_#in~len| 1)} assume true; {5284#(<= |sll_create_#in~len| 1)} is VALID [2020-07-18 05:16:53,604 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {5284#(<= |sll_create_#in~len| 1)} {5250#(<= 3 main_~len~1)} #141#return; {5242#false} is VALID [2020-07-18 05:16:53,604 INFO L280 TraceCheckUtils]: 41: Hoare triple {5242#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {5242#false} is VALID [2020-07-18 05:16:53,604 INFO L280 TraceCheckUtils]: 42: Hoare triple {5242#false} havoc #t~ret10.base, #t~ret10.offset; {5242#false} is VALID [2020-07-18 05:16:53,604 INFO L263 TraceCheckUtils]: 43: Hoare triple {5242#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {5241#true} is VALID [2020-07-18 05:16:53,604 INFO L280 TraceCheckUtils]: 44: Hoare triple {5241#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {5241#true} is VALID [2020-07-18 05:16:53,604 INFO L280 TraceCheckUtils]: 45: Hoare triple {5241#true} ~len~0 := 0; {5241#true} is VALID [2020-07-18 05:16:53,605 INFO L280 TraceCheckUtils]: 46: Hoare triple {5241#true} assume !!(~head.base != 0 || ~head.offset != 0); {5241#true} is VALID [2020-07-18 05:16:53,605 INFO L280 TraceCheckUtils]: 47: Hoare triple {5241#true} #t~post4 := ~len~0; {5241#true} is VALID [2020-07-18 05:16:53,605 INFO L280 TraceCheckUtils]: 48: Hoare triple {5241#true} ~len~0 := 1 + #t~post4; {5241#true} is VALID [2020-07-18 05:16:53,605 INFO L280 TraceCheckUtils]: 49: Hoare triple {5241#true} havoc #t~post4; {5241#true} is VALID [2020-07-18 05:16:53,605 INFO L280 TraceCheckUtils]: 50: Hoare triple {5241#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {5241#true} is VALID [2020-07-18 05:16:53,605 INFO L280 TraceCheckUtils]: 51: Hoare triple {5241#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {5241#true} is VALID [2020-07-18 05:16:53,605 INFO L280 TraceCheckUtils]: 52: Hoare triple {5241#true} havoc #t~mem5.base, #t~mem5.offset; {5241#true} is VALID [2020-07-18 05:16:53,605 INFO L280 TraceCheckUtils]: 53: Hoare triple {5241#true} assume !(~head.base != 0 || ~head.offset != 0); {5241#true} is VALID [2020-07-18 05:16:53,606 INFO L280 TraceCheckUtils]: 54: Hoare triple {5241#true} #res := ~len~0; {5241#true} is VALID [2020-07-18 05:16:53,606 INFO L280 TraceCheckUtils]: 55: Hoare triple {5241#true} assume true; {5241#true} is VALID [2020-07-18 05:16:53,606 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {5241#true} {5242#false} #143#return; {5242#false} is VALID [2020-07-18 05:16:53,606 INFO L280 TraceCheckUtils]: 57: Hoare triple {5242#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {5242#false} is VALID [2020-07-18 05:16:53,606 INFO L280 TraceCheckUtils]: 58: Hoare triple {5242#false} assume ~len~1 != #t~ret11; {5242#false} is VALID [2020-07-18 05:16:53,606 INFO L280 TraceCheckUtils]: 59: Hoare triple {5242#false} havoc #t~ret11; {5242#false} is VALID [2020-07-18 05:16:53,606 INFO L280 TraceCheckUtils]: 60: Hoare triple {5242#false} assume !false; {5242#false} is VALID [2020-07-18 05:16:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 05:16:53,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [110166763] [2020-07-18 05:16:53,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:16:53,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 05:16:53,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478763792] [2020-07-18 05:16:53,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2020-07-18 05:16:53,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:53,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 05:16:53,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:53,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 05:16:53,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 05:16:53,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-18 05:16:53,679 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 11 states. [2020-07-18 05:16:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:55,322 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2020-07-18 05:16:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 05:16:55,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2020-07-18 05:16:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 05:16:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 121 transitions. [2020-07-18 05:16:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 05:16:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 121 transitions. [2020-07-18 05:16:55,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 121 transitions. [2020-07-18 05:16:55,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:55,492 INFO L225 Difference]: With dead ends: 125 [2020-07-18 05:16:55,493 INFO L226 Difference]: Without dead ends: 101 [2020-07-18 05:16:55,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-07-18 05:16:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-18 05:16:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2020-07-18 05:16:55,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:55,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 93 states. [2020-07-18 05:16:55,763 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 93 states. [2020-07-18 05:16:55,763 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 93 states. [2020-07-18 05:16:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:55,767 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2020-07-18 05:16:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2020-07-18 05:16:55,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:55,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:55,768 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 101 states. [2020-07-18 05:16:55,768 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 101 states. [2020-07-18 05:16:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:55,788 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2020-07-18 05:16:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2020-07-18 05:16:55,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:55,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:55,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:55,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-18 05:16:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2020-07-18 05:16:55,792 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 61 [2020-07-18 05:16:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:55,792 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2020-07-18 05:16:55,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 05:16:55,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 99 transitions. [2020-07-18 05:16:55,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2020-07-18 05:16:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-18 05:16:55,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:55,958 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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-18 05:16:55,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 05:16:55,958 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:55,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1187742581, now seen corresponding path program 3 times [2020-07-18 05:16:55,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:55,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014647454] [2020-07-18 05:16:55,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:56,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {5999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5944#true} is VALID [2020-07-18 05:16:56,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {5944#true} #valid := #valid[0 := 0]; {5944#true} is VALID [2020-07-18 05:16:56,078 INFO L280 TraceCheckUtils]: 2: Hoare triple {5944#true} assume 0 < #StackHeapBarrier; {5944#true} is VALID [2020-07-18 05:16:56,078 INFO L280 TraceCheckUtils]: 3: Hoare triple {5944#true} assume true; {5944#true} is VALID [2020-07-18 05:16:56,078 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5944#true} {5944#true} #147#return; {5944#true} is VALID [2020-07-18 05:16:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:56,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {6000#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {5944#true} is VALID [2020-07-18 05:16:56,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {5944#true} ~head~0.base, ~head~0.offset := 0, 0; {5944#true} is VALID [2020-07-18 05:16:56,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {5944#true} assume !!(~len > 0); {5944#true} is VALID [2020-07-18 05:16:56,234 INFO L280 TraceCheckUtils]: 3: Hoare triple {5944#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {5944#true} is VALID [2020-07-18 05:16:56,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {5944#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5944#true} is VALID [2020-07-18 05:16:56,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {5944#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5944#true} is VALID [2020-07-18 05:16:56,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {5944#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {5944#true} is VALID [2020-07-18 05:16:56,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {5944#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5944#true} is VALID [2020-07-18 05:16:56,235 INFO L280 TraceCheckUtils]: 8: Hoare triple {5944#true} #t~post3 := ~len; {5944#true} is VALID [2020-07-18 05:16:56,235 INFO L280 TraceCheckUtils]: 9: Hoare triple {5944#true} ~len := #t~post3 - 1; {5944#true} is VALID [2020-07-18 05:16:56,236 INFO L280 TraceCheckUtils]: 10: Hoare triple {5944#true} havoc #t~post3; {5944#true} is VALID [2020-07-18 05:16:56,236 INFO L280 TraceCheckUtils]: 11: Hoare triple {5944#true} assume !!(~len > 0); {5944#true} is VALID [2020-07-18 05:16:56,237 INFO L280 TraceCheckUtils]: 12: Hoare triple {5944#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6001#(not (= 0 |sll_create_#t~malloc2.base|))} is VALID [2020-07-18 05:16:56,237 INFO L280 TraceCheckUtils]: 13: Hoare triple {6001#(not (= 0 |sll_create_#t~malloc2.base|))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:56,238 INFO L280 TraceCheckUtils]: 14: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:56,238 INFO L280 TraceCheckUtils]: 15: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:56,239 INFO L280 TraceCheckUtils]: 16: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,240 INFO L280 TraceCheckUtils]: 17: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} #t~post3 := ~len; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,240 INFO L280 TraceCheckUtils]: 18: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} ~len := #t~post3 - 1; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,241 INFO L280 TraceCheckUtils]: 19: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} havoc #t~post3; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,241 INFO L280 TraceCheckUtils]: 20: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0); {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,242 INFO L280 TraceCheckUtils]: 21: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,242 INFO L280 TraceCheckUtils]: 22: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,243 INFO L280 TraceCheckUtils]: 23: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,244 INFO L280 TraceCheckUtils]: 24: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6004#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset)))} is VALID [2020-07-18 05:16:56,245 INFO L280 TraceCheckUtils]: 25: Hoare triple {6004#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,246 INFO L280 TraceCheckUtils]: 26: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #t~post3 := ~len; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,246 INFO L280 TraceCheckUtils]: 27: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} ~len := #t~post3 - 1; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,247 INFO L280 TraceCheckUtils]: 28: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} havoc #t~post3; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,247 INFO L280 TraceCheckUtils]: 29: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(~len > 0); {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,248 INFO L280 TraceCheckUtils]: 30: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-18 05:16:56,249 INFO L280 TraceCheckUtils]: 31: Hoare triple {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-18 05:16:56,250 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {5944#true} #141#return; {5984#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2020-07-18 05:16:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:56,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {5944#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} ~len~0 := 0; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} assume !!(~head.base != 0 || ~head.offset != 0); {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} #t~post4 := ~len~0; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,347 INFO L280 TraceCheckUtils]: 4: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} ~len~0 := 1 + #t~post4; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} havoc #t~post4; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,349 INFO L280 TraceCheckUtils]: 6: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6008#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) |sll_length_#t~mem5.base|)} is VALID [2020-07-18 05:16:56,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {6008#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) |sll_length_#t~mem5.base|)} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-18 05:16:56,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} havoc #t~mem5.base, #t~mem5.offset; {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-18 05:16:56,351 INFO L280 TraceCheckUtils]: 9: Hoare triple {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-18 05:16:56,351 INFO L280 TraceCheckUtils]: 10: Hoare triple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} #res := ~len~0; {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-18 05:16:56,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} assume true; {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-18 05:16:56,353 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #143#return; {5945#false} is VALID [2020-07-18 05:16:56,354 INFO L263 TraceCheckUtils]: 0: Hoare triple {5944#true} call ULTIMATE.init(); {5999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:16:56,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {5999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5944#true} is VALID [2020-07-18 05:16:56,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {5944#true} #valid := #valid[0 := 0]; {5944#true} is VALID [2020-07-18 05:16:56,355 INFO L280 TraceCheckUtils]: 3: Hoare triple {5944#true} assume 0 < #StackHeapBarrier; {5944#true} is VALID [2020-07-18 05:16:56,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {5944#true} assume true; {5944#true} is VALID [2020-07-18 05:16:56,355 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5944#true} {5944#true} #147#return; {5944#true} is VALID [2020-07-18 05:16:56,355 INFO L263 TraceCheckUtils]: 6: Hoare triple {5944#true} call #t~ret12 := main(); {5944#true} is VALID [2020-07-18 05:16:56,355 INFO L280 TraceCheckUtils]: 7: Hoare triple {5944#true} ~len~1 := 2; {5944#true} is VALID [2020-07-18 05:16:56,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {5944#true} #t~short8 := ~len~1 < 32; {5944#true} is VALID [2020-07-18 05:16:56,356 INFO L280 TraceCheckUtils]: 9: Hoare triple {5944#true} assume #t~short8; {5944#true} is VALID [2020-07-18 05:16:56,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {5944#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5944#true} is VALID [2020-07-18 05:16:56,356 INFO L280 TraceCheckUtils]: 11: Hoare triple {5944#true} #t~short8 := 0 != #t~nondet7; {5944#true} is VALID [2020-07-18 05:16:56,356 INFO L280 TraceCheckUtils]: 12: Hoare triple {5944#true} assume !#t~short8; {5944#true} is VALID [2020-07-18 05:16:56,356 INFO L280 TraceCheckUtils]: 13: Hoare triple {5944#true} havoc #t~short8; {5944#true} is VALID [2020-07-18 05:16:56,356 INFO L280 TraceCheckUtils]: 14: Hoare triple {5944#true} havoc #t~nondet7; {5944#true} is VALID [2020-07-18 05:16:56,357 INFO L263 TraceCheckUtils]: 15: Hoare triple {5944#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {6000#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:16:56,358 INFO L280 TraceCheckUtils]: 16: Hoare triple {6000#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {5944#true} is VALID [2020-07-18 05:16:56,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {5944#true} ~head~0.base, ~head~0.offset := 0, 0; {5944#true} is VALID [2020-07-18 05:16:56,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {5944#true} assume !!(~len > 0); {5944#true} is VALID [2020-07-18 05:16:56,358 INFO L280 TraceCheckUtils]: 19: Hoare triple {5944#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {5944#true} is VALID [2020-07-18 05:16:56,358 INFO L280 TraceCheckUtils]: 20: Hoare triple {5944#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5944#true} is VALID [2020-07-18 05:16:56,359 INFO L280 TraceCheckUtils]: 21: Hoare triple {5944#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5944#true} is VALID [2020-07-18 05:16:56,359 INFO L280 TraceCheckUtils]: 22: Hoare triple {5944#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {5944#true} is VALID [2020-07-18 05:16:56,359 INFO L280 TraceCheckUtils]: 23: Hoare triple {5944#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5944#true} is VALID [2020-07-18 05:16:56,359 INFO L280 TraceCheckUtils]: 24: Hoare triple {5944#true} #t~post3 := ~len; {5944#true} is VALID [2020-07-18 05:16:56,359 INFO L280 TraceCheckUtils]: 25: Hoare triple {5944#true} ~len := #t~post3 - 1; {5944#true} is VALID [2020-07-18 05:16:56,359 INFO L280 TraceCheckUtils]: 26: Hoare triple {5944#true} havoc #t~post3; {5944#true} is VALID [2020-07-18 05:16:56,360 INFO L280 TraceCheckUtils]: 27: Hoare triple {5944#true} assume !!(~len > 0); {5944#true} is VALID [2020-07-18 05:16:56,360 INFO L280 TraceCheckUtils]: 28: Hoare triple {5944#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6001#(not (= 0 |sll_create_#t~malloc2.base|))} is VALID [2020-07-18 05:16:56,361 INFO L280 TraceCheckUtils]: 29: Hoare triple {6001#(not (= 0 |sll_create_#t~malloc2.base|))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:56,361 INFO L280 TraceCheckUtils]: 30: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:56,362 INFO L280 TraceCheckUtils]: 31: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6002#(not (= 0 sll_create_~new_head~0.base))} is VALID [2020-07-18 05:16:56,363 INFO L280 TraceCheckUtils]: 32: Hoare triple {6002#(not (= 0 sll_create_~new_head~0.base))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,363 INFO L280 TraceCheckUtils]: 33: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} #t~post3 := ~len; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,364 INFO L280 TraceCheckUtils]: 34: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} ~len := #t~post3 - 1; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,364 INFO L280 TraceCheckUtils]: 35: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} havoc #t~post3; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,365 INFO L280 TraceCheckUtils]: 36: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0); {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,365 INFO L280 TraceCheckUtils]: 37: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,366 INFO L280 TraceCheckUtils]: 38: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,366 INFO L280 TraceCheckUtils]: 39: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6003#(not (= 0 sll_create_~head~0.base))} is VALID [2020-07-18 05:16:56,367 INFO L280 TraceCheckUtils]: 40: Hoare triple {6003#(not (= 0 sll_create_~head~0.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6004#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset)))} is VALID [2020-07-18 05:16:56,368 INFO L280 TraceCheckUtils]: 41: Hoare triple {6004#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset)))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,369 INFO L280 TraceCheckUtils]: 42: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #t~post3 := ~len; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,369 INFO L280 TraceCheckUtils]: 43: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} ~len := #t~post3 - 1; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,370 INFO L280 TraceCheckUtils]: 44: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} havoc #t~post3; {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,370 INFO L280 TraceCheckUtils]: 45: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(~len > 0); {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2020-07-18 05:16:56,371 INFO L280 TraceCheckUtils]: 46: Hoare triple {6005#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-18 05:16:56,372 INFO L280 TraceCheckUtils]: 47: Hoare triple {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2020-07-18 05:16:56,373 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {6006#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {5944#true} #141#return; {5984#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2020-07-18 05:16:56,374 INFO L280 TraceCheckUtils]: 49: Hoare triple {5984#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2020-07-18 05:16:56,375 INFO L280 TraceCheckUtils]: 50: Hoare triple {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} havoc #t~ret10.base, #t~ret10.offset; {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2020-07-18 05:16:56,375 INFO L263 TraceCheckUtils]: 51: Hoare triple {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {5944#true} is VALID [2020-07-18 05:16:56,375 INFO L280 TraceCheckUtils]: 52: Hoare triple {5944#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,376 INFO L280 TraceCheckUtils]: 53: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} ~len~0 := 0; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,377 INFO L280 TraceCheckUtils]: 54: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} assume !!(~head.base != 0 || ~head.offset != 0); {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,377 INFO L280 TraceCheckUtils]: 55: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} #t~post4 := ~len~0; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,378 INFO L280 TraceCheckUtils]: 56: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} ~len~0 := 1 + #t~post4; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,379 INFO L280 TraceCheckUtils]: 57: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} havoc #t~post4; {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} is VALID [2020-07-18 05:16:56,379 INFO L280 TraceCheckUtils]: 58: Hoare triple {6007#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6008#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) |sll_length_#t~mem5.base|)} is VALID [2020-07-18 05:16:56,380 INFO L280 TraceCheckUtils]: 59: Hoare triple {6008#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) |sll_length_#t~mem5.base|)} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-18 05:16:56,381 INFO L280 TraceCheckUtils]: 60: Hoare triple {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} havoc #t~mem5.base, #t~mem5.offset; {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2020-07-18 05:16:56,381 INFO L280 TraceCheckUtils]: 61: Hoare triple {6009#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-18 05:16:56,382 INFO L280 TraceCheckUtils]: 62: Hoare triple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} #res := ~len~0; {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-18 05:16:56,382 INFO L280 TraceCheckUtils]: 63: Hoare triple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} assume true; {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} is VALID [2020-07-18 05:16:56,383 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {6010#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0)} {5985#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #143#return; {5945#false} is VALID [2020-07-18 05:16:56,384 INFO L280 TraceCheckUtils]: 65: Hoare triple {5945#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {5945#false} is VALID [2020-07-18 05:16:56,384 INFO L280 TraceCheckUtils]: 66: Hoare triple {5945#false} assume ~len~1 != #t~ret11; {5945#false} is VALID [2020-07-18 05:16:56,384 INFO L280 TraceCheckUtils]: 67: Hoare triple {5945#false} havoc #t~ret11; {5945#false} is VALID [2020-07-18 05:16:56,384 INFO L280 TraceCheckUtils]: 68: Hoare triple {5945#false} assume !false; {5945#false} is VALID [2020-07-18 05:16:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 05:16:56,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014647454] [2020-07-18 05:16:56,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:16:56,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-18 05:16:56,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268833548] [2020-07-18 05:16:56,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2020-07-18 05:16:56,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:16:56,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-18 05:16:56,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:56,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-18 05:16:56,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:16:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-18 05:16:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-07-18 05:16:56,466 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 16 states. [2020-07-18 05:16:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:59,129 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2020-07-18 05:16:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-18 05:16:59,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2020-07-18 05:16:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:16:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 05:16:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2020-07-18 05:16:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 05:16:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 94 transitions. [2020-07-18 05:16:59,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 94 transitions. [2020-07-18 05:16:59,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:59,288 INFO L225 Difference]: With dead ends: 113 [2020-07-18 05:16:59,289 INFO L226 Difference]: Without dead ends: 105 [2020-07-18 05:16:59,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2020-07-18 05:16:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-18 05:16:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2020-07-18 05:16:59,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:16:59,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 100 states. [2020-07-18 05:16:59,651 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 100 states. [2020-07-18 05:16:59,651 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 100 states. [2020-07-18 05:16:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:59,654 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2020-07-18 05:16:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2020-07-18 05:16:59,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:59,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:59,656 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 105 states. [2020-07-18 05:16:59,656 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 105 states. [2020-07-18 05:16:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:16:59,659 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2020-07-18 05:16:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2020-07-18 05:16:59,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:16:59,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:16:59,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:16:59,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:16:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-18 05:16:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2020-07-18 05:16:59,665 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 69 [2020-07-18 05:16:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:16:59,665 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2020-07-18 05:16:59,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-18 05:16:59,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 106 transitions. [2020-07-18 05:16:59,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:16:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2020-07-18 05:16:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-18 05:16:59,885 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:16:59,885 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2020-07-18 05:16:59,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 05:16:59,885 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:16:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:16:59,886 INFO L82 PathProgramCache]: Analyzing trace with hash 979580858, now seen corresponding path program 4 times [2020-07-18 05:16:59,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:16:59,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798400972] [2020-07-18 05:16:59,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:16:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:16:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:17:00,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {6739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6677#true} is VALID [2020-07-18 05:17:00,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {6677#true} #valid := #valid[0 := 0]; {6677#true} is VALID [2020-07-18 05:17:00,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {6677#true} assume 0 < #StackHeapBarrier; {6677#true} is VALID [2020-07-18 05:17:00,004 INFO L280 TraceCheckUtils]: 3: Hoare triple {6677#true} assume true; {6677#true} is VALID [2020-07-18 05:17:00,004 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6677#true} {6677#true} #147#return; {6677#true} is VALID [2020-07-18 05:17:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:17:00,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {6740#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {6677#true} is VALID [2020-07-18 05:17:00,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := 0, 0; {6677#true} is VALID [2020-07-18 05:17:00,062 INFO L280 TraceCheckUtils]: 2: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-18 05:17:00,062 INFO L280 TraceCheckUtils]: 3: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-18 05:17:00,062 INFO L280 TraceCheckUtils]: 4: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-18 05:17:00,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-18 05:17:00,062 INFO L280 TraceCheckUtils]: 6: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-18 05:17:00,063 INFO L280 TraceCheckUtils]: 7: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-18 05:17:00,063 INFO L280 TraceCheckUtils]: 8: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-18 05:17:00,063 INFO L280 TraceCheckUtils]: 9: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-18 05:17:00,063 INFO L280 TraceCheckUtils]: 10: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-18 05:17:00,063 INFO L280 TraceCheckUtils]: 11: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-18 05:17:00,064 INFO L280 TraceCheckUtils]: 12: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-18 05:17:00,064 INFO L280 TraceCheckUtils]: 13: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-18 05:17:00,064 INFO L280 TraceCheckUtils]: 14: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-18 05:17:00,064 INFO L280 TraceCheckUtils]: 15: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-18 05:17:00,064 INFO L280 TraceCheckUtils]: 16: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-18 05:17:00,065 INFO L280 TraceCheckUtils]: 17: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-18 05:17:00,065 INFO L280 TraceCheckUtils]: 18: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-18 05:17:00,065 INFO L280 TraceCheckUtils]: 19: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-18 05:17:00,065 INFO L280 TraceCheckUtils]: 20: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-18 05:17:00,065 INFO L280 TraceCheckUtils]: 21: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-18 05:17:00,066 INFO L280 TraceCheckUtils]: 22: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-18 05:17:00,066 INFO L280 TraceCheckUtils]: 23: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-18 05:17:00,066 INFO L280 TraceCheckUtils]: 24: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-18 05:17:00,066 INFO L280 TraceCheckUtils]: 25: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-18 05:17:00,066 INFO L280 TraceCheckUtils]: 26: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-18 05:17:00,066 INFO L280 TraceCheckUtils]: 27: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-18 05:17:00,067 INFO L280 TraceCheckUtils]: 28: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-18 05:17:00,067 INFO L280 TraceCheckUtils]: 29: Hoare triple {6677#true} assume !(~len > 0); {6677#true} is VALID [2020-07-18 05:17:00,067 INFO L280 TraceCheckUtils]: 30: Hoare triple {6677#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6677#true} is VALID [2020-07-18 05:17:00,067 INFO L280 TraceCheckUtils]: 31: Hoare triple {6677#true} assume true; {6677#true} is VALID [2020-07-18 05:17:00,068 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {6677#true} {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #141#return; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:17:00,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {6677#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {6677#true} is VALID [2020-07-18 05:17:00,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {6677#true} ~len~0 := 0; {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-18 05:17:00,210 INFO L280 TraceCheckUtils]: 2: Hoare triple {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} assume !!(~head.base != 0 || ~head.offset != 0); {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-18 05:17:00,211 INFO L280 TraceCheckUtils]: 3: Hoare triple {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} #t~post4 := ~len~0; {6742#(and (<= |sll_length_#t~post4| 0) (<= 0 |sll_length_#t~post4|))} is VALID [2020-07-18 05:17:00,212 INFO L280 TraceCheckUtils]: 4: Hoare triple {6742#(and (<= |sll_length_#t~post4| 0) (<= 0 |sll_length_#t~post4|))} ~len~0 := 1 + #t~post4; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,212 INFO L280 TraceCheckUtils]: 5: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} havoc #t~post4; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,213 INFO L280 TraceCheckUtils]: 6: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,213 INFO L280 TraceCheckUtils]: 7: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,214 INFO L280 TraceCheckUtils]: 8: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} havoc #t~mem5.base, #t~mem5.offset; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,219 INFO L280 TraceCheckUtils]: 9: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} assume !!(~head.base != 0 || ~head.offset != 0); {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,219 INFO L280 TraceCheckUtils]: 10: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} #t~post4 := ~len~0; {6744#(and (<= 1 |sll_length_#t~post4|) (<= |sll_length_#t~post4| 1))} is VALID [2020-07-18 05:17:00,220 INFO L280 TraceCheckUtils]: 11: Hoare triple {6744#(and (<= 1 |sll_length_#t~post4|) (<= |sll_length_#t~post4| 1))} ~len~0 := 1 + #t~post4; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,221 INFO L280 TraceCheckUtils]: 12: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} havoc #t~post4; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,222 INFO L280 TraceCheckUtils]: 13: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,222 INFO L280 TraceCheckUtils]: 14: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,223 INFO L280 TraceCheckUtils]: 15: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} havoc #t~mem5.base, #t~mem5.offset; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,223 INFO L280 TraceCheckUtils]: 16: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,224 INFO L280 TraceCheckUtils]: 17: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-18 05:17:00,224 INFO L280 TraceCheckUtils]: 18: Hoare triple {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-18 05:17:00,226 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #143#return; {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-18 05:17:00,230 INFO L263 TraceCheckUtils]: 0: Hoare triple {6677#true} call ULTIMATE.init(); {6739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:17:00,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {6739#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6677#true} is VALID [2020-07-18 05:17:00,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {6677#true} #valid := #valid[0 := 0]; {6677#true} is VALID [2020-07-18 05:17:00,230 INFO L280 TraceCheckUtils]: 3: Hoare triple {6677#true} assume 0 < #StackHeapBarrier; {6677#true} is VALID [2020-07-18 05:17:00,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {6677#true} assume true; {6677#true} is VALID [2020-07-18 05:17:00,231 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6677#true} {6677#true} #147#return; {6677#true} is VALID [2020-07-18 05:17:00,231 INFO L263 TraceCheckUtils]: 6: Hoare triple {6677#true} call #t~ret12 := main(); {6677#true} is VALID [2020-07-18 05:17:00,232 INFO L280 TraceCheckUtils]: 7: Hoare triple {6677#true} ~len~1 := 2; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,232 INFO L280 TraceCheckUtils]: 8: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #t~short8 := ~len~1 < 32; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,233 INFO L280 TraceCheckUtils]: 9: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume #t~short8; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,233 INFO L280 TraceCheckUtils]: 10: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,234 INFO L280 TraceCheckUtils]: 11: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #t~short8 := 0 != #t~nondet7; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,234 INFO L280 TraceCheckUtils]: 12: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} assume !#t~short8; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,234 INFO L280 TraceCheckUtils]: 13: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} havoc #t~short8; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,235 INFO L280 TraceCheckUtils]: 14: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} havoc #t~nondet7; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,236 INFO L263 TraceCheckUtils]: 15: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {6740#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:17:00,236 INFO L280 TraceCheckUtils]: 16: Hoare triple {6740#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {6677#true} is VALID [2020-07-18 05:17:00,236 INFO L280 TraceCheckUtils]: 17: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := 0, 0; {6677#true} is VALID [2020-07-18 05:17:00,236 INFO L280 TraceCheckUtils]: 18: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-18 05:17:00,236 INFO L280 TraceCheckUtils]: 19: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-18 05:17:00,236 INFO L280 TraceCheckUtils]: 20: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-18 05:17:00,236 INFO L280 TraceCheckUtils]: 21: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-18 05:17:00,237 INFO L280 TraceCheckUtils]: 22: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-18 05:17:00,237 INFO L280 TraceCheckUtils]: 23: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-18 05:17:00,237 INFO L280 TraceCheckUtils]: 24: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-18 05:17:00,237 INFO L280 TraceCheckUtils]: 25: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-18 05:17:00,237 INFO L280 TraceCheckUtils]: 26: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-18 05:17:00,237 INFO L280 TraceCheckUtils]: 27: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-18 05:17:00,237 INFO L280 TraceCheckUtils]: 28: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-18 05:17:00,238 INFO L280 TraceCheckUtils]: 29: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-18 05:17:00,238 INFO L280 TraceCheckUtils]: 30: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-18 05:17:00,238 INFO L280 TraceCheckUtils]: 31: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-18 05:17:00,238 INFO L280 TraceCheckUtils]: 32: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-18 05:17:00,238 INFO L280 TraceCheckUtils]: 33: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-18 05:17:00,238 INFO L280 TraceCheckUtils]: 34: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-18 05:17:00,238 INFO L280 TraceCheckUtils]: 35: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-18 05:17:00,238 INFO L280 TraceCheckUtils]: 36: Hoare triple {6677#true} assume !!(~len > 0); {6677#true} is VALID [2020-07-18 05:17:00,239 INFO L280 TraceCheckUtils]: 37: Hoare triple {6677#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {6677#true} is VALID [2020-07-18 05:17:00,239 INFO L280 TraceCheckUtils]: 38: Hoare triple {6677#true} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6677#true} is VALID [2020-07-18 05:17:00,239 INFO L280 TraceCheckUtils]: 39: Hoare triple {6677#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6677#true} is VALID [2020-07-18 05:17:00,239 INFO L280 TraceCheckUtils]: 40: Hoare triple {6677#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {6677#true} is VALID [2020-07-18 05:17:00,239 INFO L280 TraceCheckUtils]: 41: Hoare triple {6677#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6677#true} is VALID [2020-07-18 05:17:00,239 INFO L280 TraceCheckUtils]: 42: Hoare triple {6677#true} #t~post3 := ~len; {6677#true} is VALID [2020-07-18 05:17:00,239 INFO L280 TraceCheckUtils]: 43: Hoare triple {6677#true} ~len := #t~post3 - 1; {6677#true} is VALID [2020-07-18 05:17:00,239 INFO L280 TraceCheckUtils]: 44: Hoare triple {6677#true} havoc #t~post3; {6677#true} is VALID [2020-07-18 05:17:00,240 INFO L280 TraceCheckUtils]: 45: Hoare triple {6677#true} assume !(~len > 0); {6677#true} is VALID [2020-07-18 05:17:00,240 INFO L280 TraceCheckUtils]: 46: Hoare triple {6677#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6677#true} is VALID [2020-07-18 05:17:00,240 INFO L280 TraceCheckUtils]: 47: Hoare triple {6677#true} assume true; {6677#true} is VALID [2020-07-18 05:17:00,241 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {6677#true} {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #141#return; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,241 INFO L280 TraceCheckUtils]: 49: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,242 INFO L280 TraceCheckUtils]: 50: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} havoc #t~ret10.base, #t~ret10.offset; {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} is VALID [2020-07-18 05:17:00,242 INFO L263 TraceCheckUtils]: 51: Hoare triple {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {6677#true} is VALID [2020-07-18 05:17:00,242 INFO L280 TraceCheckUtils]: 52: Hoare triple {6677#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {6677#true} is VALID [2020-07-18 05:17:00,242 INFO L280 TraceCheckUtils]: 53: Hoare triple {6677#true} ~len~0 := 0; {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-18 05:17:00,243 INFO L280 TraceCheckUtils]: 54: Hoare triple {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} assume !!(~head.base != 0 || ~head.offset != 0); {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} is VALID [2020-07-18 05:17:00,243 INFO L280 TraceCheckUtils]: 55: Hoare triple {6741#(and (<= 0 sll_length_~len~0) (<= sll_length_~len~0 0))} #t~post4 := ~len~0; {6742#(and (<= |sll_length_#t~post4| 0) (<= 0 |sll_length_#t~post4|))} is VALID [2020-07-18 05:17:00,244 INFO L280 TraceCheckUtils]: 56: Hoare triple {6742#(and (<= |sll_length_#t~post4| 0) (<= 0 |sll_length_#t~post4|))} ~len~0 := 1 + #t~post4; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,244 INFO L280 TraceCheckUtils]: 57: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} havoc #t~post4; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,251 INFO L280 TraceCheckUtils]: 58: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,251 INFO L280 TraceCheckUtils]: 59: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,252 INFO L280 TraceCheckUtils]: 60: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} havoc #t~mem5.base, #t~mem5.offset; {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,252 INFO L280 TraceCheckUtils]: 61: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} assume !!(~head.base != 0 || ~head.offset != 0); {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} is VALID [2020-07-18 05:17:00,256 INFO L280 TraceCheckUtils]: 62: Hoare triple {6743#(and (<= 1 sll_length_~len~0) (<= sll_length_~len~0 1))} #t~post4 := ~len~0; {6744#(and (<= 1 |sll_length_#t~post4|) (<= |sll_length_#t~post4| 1))} is VALID [2020-07-18 05:17:00,257 INFO L280 TraceCheckUtils]: 63: Hoare triple {6744#(and (<= 1 |sll_length_#t~post4|) (<= |sll_length_#t~post4| 1))} ~len~0 := 1 + #t~post4; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,258 INFO L280 TraceCheckUtils]: 64: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} havoc #t~post4; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,258 INFO L280 TraceCheckUtils]: 65: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,259 INFO L280 TraceCheckUtils]: 66: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,260 INFO L280 TraceCheckUtils]: 67: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} havoc #t~mem5.base, #t~mem5.offset; {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,260 INFO L280 TraceCheckUtils]: 68: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2020-07-18 05:17:00,261 INFO L280 TraceCheckUtils]: 69: Hoare triple {6745#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-18 05:17:00,261 INFO L280 TraceCheckUtils]: 70: Hoare triple {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2020-07-18 05:17:00,262 INFO L275 TraceCheckUtils]: 71: Hoare quadruple {6746#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {6684#(and (<= main_~len~1 2) (<= 2 main_~len~1))} #143#return; {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-18 05:17:00,263 INFO L280 TraceCheckUtils]: 72: Hoare triple {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} is VALID [2020-07-18 05:17:00,263 INFO L280 TraceCheckUtils]: 73: Hoare triple {6738#(and (<= |main_#t~ret11| main_~len~1) (<= main_~len~1 |main_#t~ret11|))} assume ~len~1 != #t~ret11; {6678#false} is VALID [2020-07-18 05:17:00,263 INFO L280 TraceCheckUtils]: 74: Hoare triple {6678#false} havoc #t~ret11; {6678#false} is VALID [2020-07-18 05:17:00,264 INFO L280 TraceCheckUtils]: 75: Hoare triple {6678#false} assume !false; {6678#false} is VALID [2020-07-18 05:17:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-18 05:17:00,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798400972] [2020-07-18 05:17:00,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:17:00,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-18 05:17:00,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917111035] [2020-07-18 05:17:00,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2020-07-18 05:17:00,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:17:00,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 05:17:00,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:17:00,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 05:17:00,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:17:00,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 05:17:00,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-18 05:17:00,335 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 12 states. [2020-07-18 05:17:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:17:02,359 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2020-07-18 05:17:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-18 05:17:02,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2020-07-18 05:17:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:17:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 05:17:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2020-07-18 05:17:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 05:17:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2020-07-18 05:17:02,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 108 transitions. [2020-07-18 05:17:02,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:17:02,507 INFO L225 Difference]: With dead ends: 125 [2020-07-18 05:17:02,507 INFO L226 Difference]: Without dead ends: 120 [2020-07-18 05:17:02,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2020-07-18 05:17:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-18 05:17:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2020-07-18 05:17:02,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:17:02,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand 113 states. [2020-07-18 05:17:02,849 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 113 states. [2020-07-18 05:17:02,849 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 113 states. [2020-07-18 05:17:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:17:02,852 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-18 05:17:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-07-18 05:17:02,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:17:02,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:17:02,853 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 120 states. [2020-07-18 05:17:02,853 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 120 states. [2020-07-18 05:17:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:17:02,856 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2020-07-18 05:17:02,856 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-07-18 05:17:02,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:17:02,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:17:02,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:17:02,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:17:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-18 05:17:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2020-07-18 05:17:02,860 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 76 [2020-07-18 05:17:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:17:02,860 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2020-07-18 05:17:02,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 05:17:02,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 121 transitions. [2020-07-18 05:17:03,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:17:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2020-07-18 05:17:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-18 05:17:03,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:17:03,094 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-18 05:17:03,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 05:17:03,094 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:17:03,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:17:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash -446623556, now seen corresponding path program 2 times [2020-07-18 05:17:03,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:17:03,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1272869518] [2020-07-18 05:17:03,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:17:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:17:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:17:03,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {7542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7488#true} is VALID [2020-07-18 05:17:03,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {7488#true} #valid := #valid[0 := 0]; {7488#true} is VALID [2020-07-18 05:17:03,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {7488#true} assume 0 < #StackHeapBarrier; {7488#true} is VALID [2020-07-18 05:17:03,189 INFO L280 TraceCheckUtils]: 3: Hoare triple {7488#true} assume true; {7488#true} is VALID [2020-07-18 05:17:03,190 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7488#true} {7488#true} #147#return; {7488#true} is VALID [2020-07-18 05:17:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:17:03,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {7543#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,342 INFO L280 TraceCheckUtils]: 2: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,343 INFO L280 TraceCheckUtils]: 3: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,344 INFO L280 TraceCheckUtils]: 4: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,344 INFO L280 TraceCheckUtils]: 5: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,345 INFO L280 TraceCheckUtils]: 6: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,346 INFO L280 TraceCheckUtils]: 7: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,347 INFO L280 TraceCheckUtils]: 8: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {7545#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-18 05:17:03,348 INFO L280 TraceCheckUtils]: 9: Hoare triple {7545#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,349 INFO L280 TraceCheckUtils]: 10: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,349 INFO L280 TraceCheckUtils]: 11: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0); {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,350 INFO L280 TraceCheckUtils]: 12: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,351 INFO L280 TraceCheckUtils]: 13: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,352 INFO L280 TraceCheckUtils]: 14: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,353 INFO L280 TraceCheckUtils]: 15: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,353 INFO L280 TraceCheckUtils]: 16: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,354 INFO L280 TraceCheckUtils]: 17: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post3 := ~len; {7547#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} is VALID [2020-07-18 05:17:03,355 INFO L280 TraceCheckUtils]: 18: Hoare triple {7547#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} ~len := #t~post3 - 1; {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-18 05:17:03,356 INFO L280 TraceCheckUtils]: 19: Hoare triple {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} havoc #t~post3; {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-18 05:17:03,357 INFO L280 TraceCheckUtils]: 20: Hoare triple {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:17:03,358 INFO L280 TraceCheckUtils]: 21: Hoare triple {7549#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:17:03,359 INFO L280 TraceCheckUtils]: 22: Hoare triple {7549#(<= |sll_create_#in~len| 2)} assume true; {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:17:03,360 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {7549#(<= |sll_create_#in~len| 2)} {7497#(<= 3 main_~len~1)} #141#return; {7489#false} is VALID [2020-07-18 05:17:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:17:03,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {7488#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {7488#true} is VALID [2020-07-18 05:17:03,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {7488#true} ~len~0 := 0; {7488#true} is VALID [2020-07-18 05:17:03,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {7488#true} assume !!(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-18 05:17:03,372 INFO L280 TraceCheckUtils]: 3: Hoare triple {7488#true} #t~post4 := ~len~0; {7488#true} is VALID [2020-07-18 05:17:03,372 INFO L280 TraceCheckUtils]: 4: Hoare triple {7488#true} ~len~0 := 1 + #t~post4; {7488#true} is VALID [2020-07-18 05:17:03,372 INFO L280 TraceCheckUtils]: 5: Hoare triple {7488#true} havoc #t~post4; {7488#true} is VALID [2020-07-18 05:17:03,372 INFO L280 TraceCheckUtils]: 6: Hoare triple {7488#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {7488#true} is VALID [2020-07-18 05:17:03,373 INFO L280 TraceCheckUtils]: 7: Hoare triple {7488#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-18 05:17:03,373 INFO L280 TraceCheckUtils]: 8: Hoare triple {7488#true} havoc #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-18 05:17:03,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {7488#true} assume !!(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-18 05:17:03,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {7488#true} #t~post4 := ~len~0; {7488#true} is VALID [2020-07-18 05:17:03,373 INFO L280 TraceCheckUtils]: 11: Hoare triple {7488#true} ~len~0 := 1 + #t~post4; {7488#true} is VALID [2020-07-18 05:17:03,374 INFO L280 TraceCheckUtils]: 12: Hoare triple {7488#true} havoc #t~post4; {7488#true} is VALID [2020-07-18 05:17:03,374 INFO L280 TraceCheckUtils]: 13: Hoare triple {7488#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {7488#true} is VALID [2020-07-18 05:17:03,374 INFO L280 TraceCheckUtils]: 14: Hoare triple {7488#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-18 05:17:03,374 INFO L280 TraceCheckUtils]: 15: Hoare triple {7488#true} havoc #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-18 05:17:03,374 INFO L280 TraceCheckUtils]: 16: Hoare triple {7488#true} assume !(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-18 05:17:03,374 INFO L280 TraceCheckUtils]: 17: Hoare triple {7488#true} #res := ~len~0; {7488#true} is VALID [2020-07-18 05:17:03,375 INFO L280 TraceCheckUtils]: 18: Hoare triple {7488#true} assume true; {7488#true} is VALID [2020-07-18 05:17:03,375 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {7488#true} {7489#false} #143#return; {7489#false} is VALID [2020-07-18 05:17:03,376 INFO L263 TraceCheckUtils]: 0: Hoare triple {7488#true} call ULTIMATE.init(); {7542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:17:03,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {7542#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7488#true} is VALID [2020-07-18 05:17:03,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {7488#true} #valid := #valid[0 := 0]; {7488#true} is VALID [2020-07-18 05:17:03,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {7488#true} assume 0 < #StackHeapBarrier; {7488#true} is VALID [2020-07-18 05:17:03,377 INFO L280 TraceCheckUtils]: 4: Hoare triple {7488#true} assume true; {7488#true} is VALID [2020-07-18 05:17:03,377 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7488#true} {7488#true} #147#return; {7488#true} is VALID [2020-07-18 05:17:03,377 INFO L263 TraceCheckUtils]: 6: Hoare triple {7488#true} call #t~ret12 := main(); {7488#true} is VALID [2020-07-18 05:17:03,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {7488#true} ~len~1 := 2; {7495#(<= 2 main_~len~1)} is VALID [2020-07-18 05:17:03,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {7495#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {7495#(<= 2 main_~len~1)} is VALID [2020-07-18 05:17:03,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {7495#(<= 2 main_~len~1)} assume #t~short8; {7495#(<= 2 main_~len~1)} is VALID [2020-07-18 05:17:03,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {7495#(<= 2 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {7495#(<= 2 main_~len~1)} is VALID [2020-07-18 05:17:03,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {7495#(<= 2 main_~len~1)} #t~short8 := 0 != #t~nondet7; {7495#(<= 2 main_~len~1)} is VALID [2020-07-18 05:17:03,380 INFO L280 TraceCheckUtils]: 12: Hoare triple {7495#(<= 2 main_~len~1)} assume !!#t~short8; {7495#(<= 2 main_~len~1)} is VALID [2020-07-18 05:17:03,381 INFO L280 TraceCheckUtils]: 13: Hoare triple {7495#(<= 2 main_~len~1)} havoc #t~short8; {7495#(<= 2 main_~len~1)} is VALID [2020-07-18 05:17:03,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {7495#(<= 2 main_~len~1)} havoc #t~nondet7; {7495#(<= 2 main_~len~1)} is VALID [2020-07-18 05:17:03,382 INFO L280 TraceCheckUtils]: 15: Hoare triple {7495#(<= 2 main_~len~1)} #t~post9 := ~len~1; {7496#(<= 2 |main_#t~post9|)} is VALID [2020-07-18 05:17:03,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {7496#(<= 2 |main_#t~post9|)} ~len~1 := 1 + #t~post9; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {7497#(<= 3 main_~len~1)} havoc #t~post9; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,384 INFO L280 TraceCheckUtils]: 18: Hoare triple {7497#(<= 3 main_~len~1)} #t~short8 := ~len~1 < 32; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,384 INFO L280 TraceCheckUtils]: 19: Hoare triple {7497#(<= 3 main_~len~1)} assume #t~short8; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,385 INFO L280 TraceCheckUtils]: 20: Hoare triple {7497#(<= 3 main_~len~1)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,385 INFO L280 TraceCheckUtils]: 21: Hoare triple {7497#(<= 3 main_~len~1)} #t~short8 := 0 != #t~nondet7; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,386 INFO L280 TraceCheckUtils]: 22: Hoare triple {7497#(<= 3 main_~len~1)} assume !#t~short8; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,386 INFO L280 TraceCheckUtils]: 23: Hoare triple {7497#(<= 3 main_~len~1)} havoc #t~short8; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,387 INFO L280 TraceCheckUtils]: 24: Hoare triple {7497#(<= 3 main_~len~1)} havoc #t~nondet7; {7497#(<= 3 main_~len~1)} is VALID [2020-07-18 05:17:03,388 INFO L263 TraceCheckUtils]: 25: Hoare triple {7497#(<= 3 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {7543#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:17:03,388 INFO L280 TraceCheckUtils]: 26: Hoare triple {7543#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~len := #in~len; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,389 INFO L280 TraceCheckUtils]: 27: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := 0, 0; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,389 INFO L280 TraceCheckUtils]: 28: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,390 INFO L280 TraceCheckUtils]: 29: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,391 INFO L280 TraceCheckUtils]: 30: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,391 INFO L280 TraceCheckUtils]: 31: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,392 INFO L280 TraceCheckUtils]: 32: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,392 INFO L280 TraceCheckUtils]: 33: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {7544#(= |sll_create_#in~len| sll_create_~len)} is VALID [2020-07-18 05:17:03,393 INFO L280 TraceCheckUtils]: 34: Hoare triple {7544#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len; {7545#(<= |sll_create_#in~len| |sll_create_#t~post3|)} is VALID [2020-07-18 05:17:03,394 INFO L280 TraceCheckUtils]: 35: Hoare triple {7545#(<= |sll_create_#in~len| |sll_create_#t~post3|)} ~len := #t~post3 - 1; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,394 INFO L280 TraceCheckUtils]: 36: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} havoc #t~post3; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,395 INFO L280 TraceCheckUtils]: 37: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0); {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,395 INFO L280 TraceCheckUtils]: 38: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4); srcloc: L566 {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,396 INFO L280 TraceCheckUtils]: 39: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,396 INFO L280 TraceCheckUtils]: 40: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,397 INFO L280 TraceCheckUtils]: 41: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); srcloc: L567-1 {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,412 INFO L280 TraceCheckUtils]: 42: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2020-07-18 05:17:03,414 INFO L280 TraceCheckUtils]: 43: Hoare triple {7546#(<= |sll_create_#in~len| (+ sll_create_~len 1))} #t~post3 := ~len; {7547#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} is VALID [2020-07-18 05:17:03,415 INFO L280 TraceCheckUtils]: 44: Hoare triple {7547#(<= |sll_create_#in~len| (+ |sll_create_#t~post3| 1))} ~len := #t~post3 - 1; {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-18 05:17:03,415 INFO L280 TraceCheckUtils]: 45: Hoare triple {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} havoc #t~post3; {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2020-07-18 05:17:03,416 INFO L280 TraceCheckUtils]: 46: Hoare triple {7548#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:17:03,416 INFO L280 TraceCheckUtils]: 47: Hoare triple {7549#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:17:03,417 INFO L280 TraceCheckUtils]: 48: Hoare triple {7549#(<= |sll_create_#in~len| 2)} assume true; {7549#(<= |sll_create_#in~len| 2)} is VALID [2020-07-18 05:17:03,418 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {7549#(<= |sll_create_#in~len| 2)} {7497#(<= 3 main_~len~1)} #141#return; {7489#false} is VALID [2020-07-18 05:17:03,418 INFO L280 TraceCheckUtils]: 50: Hoare triple {7489#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; {7489#false} is VALID [2020-07-18 05:17:03,418 INFO L280 TraceCheckUtils]: 51: Hoare triple {7489#false} havoc #t~ret10.base, #t~ret10.offset; {7489#false} is VALID [2020-07-18 05:17:03,419 INFO L263 TraceCheckUtils]: 52: Hoare triple {7489#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {7488#true} is VALID [2020-07-18 05:17:03,419 INFO L280 TraceCheckUtils]: 53: Hoare triple {7488#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset; {7488#true} is VALID [2020-07-18 05:17:03,419 INFO L280 TraceCheckUtils]: 54: Hoare triple {7488#true} ~len~0 := 0; {7488#true} is VALID [2020-07-18 05:17:03,419 INFO L280 TraceCheckUtils]: 55: Hoare triple {7488#true} assume !!(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-18 05:17:03,419 INFO L280 TraceCheckUtils]: 56: Hoare triple {7488#true} #t~post4 := ~len~0; {7488#true} is VALID [2020-07-18 05:17:03,420 INFO L280 TraceCheckUtils]: 57: Hoare triple {7488#true} ~len~0 := 1 + #t~post4; {7488#true} is VALID [2020-07-18 05:17:03,420 INFO L280 TraceCheckUtils]: 58: Hoare triple {7488#true} havoc #t~post4; {7488#true} is VALID [2020-07-18 05:17:03,420 INFO L280 TraceCheckUtils]: 59: Hoare triple {7488#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {7488#true} is VALID [2020-07-18 05:17:03,420 INFO L280 TraceCheckUtils]: 60: Hoare triple {7488#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-18 05:17:03,420 INFO L280 TraceCheckUtils]: 61: Hoare triple {7488#true} havoc #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-18 05:17:03,421 INFO L280 TraceCheckUtils]: 62: Hoare triple {7488#true} assume !!(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-18 05:17:03,421 INFO L280 TraceCheckUtils]: 63: Hoare triple {7488#true} #t~post4 := ~len~0; {7488#true} is VALID [2020-07-18 05:17:03,421 INFO L280 TraceCheckUtils]: 64: Hoare triple {7488#true} ~len~0 := 1 + #t~post4; {7488#true} is VALID [2020-07-18 05:17:03,421 INFO L280 TraceCheckUtils]: 65: Hoare triple {7488#true} havoc #t~post4; {7488#true} is VALID [2020-07-18 05:17:03,421 INFO L280 TraceCheckUtils]: 66: Hoare triple {7488#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); srcloc: L580 {7488#true} is VALID [2020-07-18 05:17:03,421 INFO L280 TraceCheckUtils]: 67: Hoare triple {7488#true} ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-18 05:17:03,422 INFO L280 TraceCheckUtils]: 68: Hoare triple {7488#true} havoc #t~mem5.base, #t~mem5.offset; {7488#true} is VALID [2020-07-18 05:17:03,422 INFO L280 TraceCheckUtils]: 69: Hoare triple {7488#true} assume !(~head.base != 0 || ~head.offset != 0); {7488#true} is VALID [2020-07-18 05:17:03,422 INFO L280 TraceCheckUtils]: 70: Hoare triple {7488#true} #res := ~len~0; {7488#true} is VALID [2020-07-18 05:17:03,422 INFO L280 TraceCheckUtils]: 71: Hoare triple {7488#true} assume true; {7488#true} is VALID [2020-07-18 05:17:03,422 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {7488#true} {7489#false} #143#return; {7489#false} is VALID [2020-07-18 05:17:03,423 INFO L280 TraceCheckUtils]: 73: Hoare triple {7489#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {7489#false} is VALID [2020-07-18 05:17:03,423 INFO L280 TraceCheckUtils]: 74: Hoare triple {7489#false} assume ~len~1 != #t~ret11; {7489#false} is VALID [2020-07-18 05:17:03,423 INFO L280 TraceCheckUtils]: 75: Hoare triple {7489#false} havoc #t~ret11; {7489#false} is VALID [2020-07-18 05:17:03,423 INFO L280 TraceCheckUtils]: 76: Hoare triple {7489#false} assume !false; {7489#false} is VALID [2020-07-18 05:17:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-18 05:17:03,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1272869518] [2020-07-18 05:17:03,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:17:03,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 05:17:03,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809336400] [2020-07-18 05:17:03,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2020-07-18 05:17:03,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:17:03,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 05:17:03,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:17:03,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 05:17:03,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:17:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 05:17:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-18 05:17:03,503 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 13 states. [2020-07-18 05:17:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:17:05,502 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2020-07-18 05:17:05,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-18 05:17:05,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2020-07-18 05:17:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:17:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 05:17:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2020-07-18 05:17:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 05:17:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 130 transitions. [2020-07-18 05:17:05,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 130 transitions. [2020-07-18 05:17:05,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:17:05,672 INFO L225 Difference]: With dead ends: 163 [2020-07-18 05:17:05,673 INFO L226 Difference]: Without dead ends: 122 [2020-07-18 05:17:05,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2020-07-18 05:17:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-18 05:17:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2020-07-18 05:17:06,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:17:06,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 110 states. [2020-07-18 05:17:06,007 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 110 states. [2020-07-18 05:17:06,008 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 110 states. [2020-07-18 05:17:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:17:06,011 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2020-07-18 05:17:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2020-07-18 05:17:06,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:17:06,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:17:06,012 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 122 states. [2020-07-18 05:17:06,012 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 122 states. [2020-07-18 05:17:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:17:06,015 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2020-07-18 05:17:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2020-07-18 05:17:06,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:17:06,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:17:06,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:17:06,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:17:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-18 05:17:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2020-07-18 05:17:06,019 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 77 [2020-07-18 05:17:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:17:06,019 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2020-07-18 05:17:06,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 05:17:06,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 117 transitions. [2020-07-18 05:17:06,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:17:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2020-07-18 05:17:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-07-18 05:17:06,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:17:06,232 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-18 05:17:06,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 05:17:06,233 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:17:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:17:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1305863211, now seen corresponding path program 5 times [2020-07-18 05:17:06,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:17:06,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1975485017] [2020-07-18 05:17:06,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:17:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 05:17:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 05:17:06,330 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 05:17:06,330 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 05:17:06,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: sll_destroyENTRY has no Hoare annotation [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: sll_createENTRY has no Hoare annotation [2020-07-18 05:17:06,405 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: sll_lengthENTRY has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L561 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-18 05:17:06,406 WARN L170 areAnnotationChecker]: L564 has no Hoare annotation [2020-07-18 05:17:06,407 WARN L170 areAnnotationChecker]: L593-11 has no Hoare annotation [2020-07-18 05:17:06,407 WARN L170 areAnnotationChecker]: L593-11 has no Hoare annotation [2020-07-18 05:17:06,407 WARN L170 areAnnotationChecker]: L577 has no Hoare annotation [2020-07-18 05:17:06,407 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 05:17:06,407 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2020-07-18 05:17:06,407 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L593-12 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L593-12 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-18 05:17:06,408 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: sll_destroyEXIT has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2020-07-18 05:17:06,409 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: L593-2 has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: L593-5 has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: L593-5 has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: L578-3 has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2020-07-18 05:17:06,410 WARN L170 areAnnotationChecker]: L586-2 has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: sll_createFINAL has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: L566-1 has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: L596-1 has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: L593-6 has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: L593-9 has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: sll_lengthFINAL has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: L579-1 has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 05:17:06,411 WARN L170 areAnnotationChecker]: L587 has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: sll_createEXIT has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: L593-7 has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: L593-10 has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: sll_lengthEXIT has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: L579-2 has no Hoare annotation [2020-07-18 05:17:06,412 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L587-1 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L567-1 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L580 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2020-07-18 05:17:06,413 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2020-07-18 05:17:06,414 WARN L170 areAnnotationChecker]: L594-1 has no Hoare annotation [2020-07-18 05:17:06,414 WARN L170 areAnnotationChecker]: L580-1 has no Hoare annotation [2020-07-18 05:17:06,414 WARN L170 areAnnotationChecker]: L572 has no Hoare annotation [2020-07-18 05:17:06,414 WARN L170 areAnnotationChecker]: L597-3 has no Hoare annotation [2020-07-18 05:17:06,414 WARN L170 areAnnotationChecker]: L597-4 has no Hoare annotation [2020-07-18 05:17:06,414 WARN L170 areAnnotationChecker]: L594-2 has no Hoare annotation [2020-07-18 05:17:06,414 WARN L170 areAnnotationChecker]: L580-2 has no Hoare annotation [2020-07-18 05:17:06,414 WARN L170 areAnnotationChecker]: L572-1 has no Hoare annotation [2020-07-18 05:17:06,415 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-18 05:17:06,415 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-18 05:17:06,415 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2020-07-18 05:17:06,415 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2020-07-18 05:17:06,415 WARN L170 areAnnotationChecker]: L572-2 has no Hoare annotation [2020-07-18 05:17:06,415 WARN L170 areAnnotationChecker]: L603 has no Hoare annotation [2020-07-18 05:17:06,415 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 05:17:06,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 05:17:06 BoogieIcfgContainer [2020-07-18 05:17:06,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 05:17:06,430 INFO L168 Benchmark]: Toolchain (without parser) took 30632.02 ms. Allocated memory was 138.9 MB in the beginning and 493.4 MB in the end (delta: 354.4 MB). Free memory was 102.4 MB in the beginning and 276.3 MB in the end (delta: -173.9 MB). Peak memory consumption was 180.5 MB. Max. memory is 7.1 GB. [2020-07-18 05:17:06,431 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 05:17:06,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.62 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 169.0 MB in the end (delta: -67.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-18 05:17:06,432 INFO L168 Benchmark]: Boogie Preprocessor took 80.11 ms. Allocated memory is still 203.4 MB. Free memory was 169.0 MB in the beginning and 165.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-18 05:17:06,433 INFO L168 Benchmark]: RCFGBuilder took 732.65 ms. Allocated memory is still 203.4 MB. Free memory was 165.5 MB in the beginning and 108.0 MB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 7.1 GB. [2020-07-18 05:17:06,435 INFO L168 Benchmark]: TraceAbstraction took 29206.07 ms. Allocated memory was 203.4 MB in the beginning and 493.4 MB in the end (delta: 289.9 MB). Free memory was 107.4 MB in the beginning and 276.3 MB in the end (delta: -169.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. [2020-07-18 05:17:06,440 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.87 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 606.62 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 169.0 MB in the end (delta: -67.0 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.11 ms. Allocated memory is still 203.4 MB. Free memory was 169.0 MB in the beginning and 165.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 732.65 ms. Allocated memory is still 203.4 MB. Free memory was 165.5 MB in the beginning and 108.0 MB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29206.07 ms. Allocated memory was 203.4 MB in the beginning and 493.4 MB in the end (delta: 289.9 MB). Free memory was 107.4 MB in the beginning and 276.3 MB in the end (delta: -169.0 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() VAL [len=2, len < 32 && __VERIFIER_nondet_int()=1] [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 VAL [\old(len)=3, head={0:0}, len=3] [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L570] new_head->next = head VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L571] head = new_head VAL [\old(len)=3, head={-1:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L572] len-- VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L565] COND TRUE len > 0 VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L570] new_head->next = head VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L571] head = new_head VAL [\old(len)=3, head={-2:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L572] len-- VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L565] COND TRUE len > 0 VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L570] new_head->next = head VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L571] head = new_head VAL [\old(len)=3, head={-3:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L572] len-- VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L574] return head; VAL [\old(len)=3, \result={-3:0}, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={-3:0}] [L596] SLL s = sll_create(len + 1); VAL [len=2, s={-3:0}, sll_create(len + 1)={-3:0}] [L597] CALL, EXPR sll_length(s) VAL [head={-3:0}] [L577] int len = 0; VAL [head={-3:0}, head={-3:0}, len=0] [L578] COND TRUE \read(head) VAL [head={-3:0}, head={-3:0}, len=0] [L579] len++ VAL [head={-3:0}, head={-3:0}, len=1] [L580] EXPR head->next VAL [head={-3:0}, head={-3:0}, head->next={-2:0}, len=1] [L580] head = head->next VAL [head={-2:0}, head={-3:0}, head->next={-2:0}, len=1] [L578] COND TRUE \read(head) VAL [head={-2:0}, head={-3:0}, len=1] [L579] len++ VAL [head={-3:0}, head={-2:0}, len=2] [L580] EXPR head->next VAL [head={-3:0}, head={-2:0}, head->next={-1:0}, len=2] [L580] head = head->next VAL [head={-3:0}, head={-1:0}, head->next={-1:0}, len=2] [L578] COND TRUE \read(head) VAL [head={-1:0}, head={-3:0}, len=2] [L579] len++ VAL [head={-1:0}, head={-3:0}, len=3] [L580] EXPR head->next VAL [head={-1:0}, head={-3:0}, head->next={0:0}, len=3] [L580] head = head->next VAL [head={0:0}, head={-3:0}, head->next={0:0}, len=3] [L578] COND FALSE !(\read(head)) VAL [head={-3:0}, head={0:0}, len=3] [L582] return len; VAL [\result=3, head={-3:0}, head={0:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L602] __VERIFIER_error() VAL [len=2, s={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.0s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 704 SDtfs, 1504 SDslu, 1656 SDs, 0 SdLazy, 3623 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 220 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 706 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 98952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 81/125 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...