/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-properties/list_search-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 05:10:37,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:10:37,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:10:37,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:10:37,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:10:37,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:10:37,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:10:37,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:10:37,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:10:37,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:10:37,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:10:37,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:10:37,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:10:37,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:10:37,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:10:37,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:10:37,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:10:37,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:10:37,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:10:37,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:10:37,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:10:37,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:10:37,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:10:37,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:10:37,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:10:37,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:10:37,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:10:37,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:10:37,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:10:37,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:10:37,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:10:37,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:10:37,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:10:37,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:10:37,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:10:37,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:10:37,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:10:37,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:10:37,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:10:37,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:10:37,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:10:37,545 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:10:37,573 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:10:37,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:10:37,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:10:37,578 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:10:37,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:10:37,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:10:37,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:10:37,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:10:37,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:10:37,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:10:37,581 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:10:37,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:10:37,582 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:10:37,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:10:37,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:10:37,582 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:10:37,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:10:37,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:10:37,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:10:37,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:10:37,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:10:37,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:10:37,584 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:10:37,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:10:37,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:10:37,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:10:37,899 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:10:37,899 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:10:37,900 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search-1.i [2020-07-18 05:10:37,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3de7cea8/e8d51a05a37d41e69a8764e7904becae/FLAG2364fd206 [2020-07-18 05:10:38,466 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:10:38,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i [2020-07-18 05:10:38,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3de7cea8/e8d51a05a37d41e69a8764e7904becae/FLAG2364fd206 [2020-07-18 05:10:38,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3de7cea8/e8d51a05a37d41e69a8764e7904becae [2020-07-18 05:10:38,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:10:38,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:10:38,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:10:38,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:10:38,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:10:38,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:10:38" (1/1) ... [2020-07-18 05:10:38,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ba5ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:38, skipping insertion in model container [2020-07-18 05:10:38,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:10:38" (1/1) ... [2020-07-18 05:10:38,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:10:38,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:10:39,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:10:39,324 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:10:39,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:10:39,448 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:10:39,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39 WrapperNode [2020-07-18 05:10:39,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:10:39,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:10:39,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:10:39,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:10:39,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (1/1) ... [2020-07-18 05:10:39,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (1/1) ... [2020-07-18 05:10:39,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (1/1) ... [2020-07-18 05:10:39,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (1/1) ... [2020-07-18 05:10:39,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (1/1) ... [2020-07-18 05:10:39,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (1/1) ... [2020-07-18 05:10:39,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (1/1) ... [2020-07-18 05:10:39,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:10:39,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:10:39,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:10:39,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:10:39,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (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:10:39,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:10:39,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:10:39,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 05:10:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-18 05:10:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-18 05:10:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-18 05:10:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-18 05:10:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-18 05:10:39,589 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2020-07-18 05:10:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2020-07-18 05:10:39,590 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:10:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:10:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 05:10:39,590 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 05:10:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 05:10:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 05:10:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 05:10:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 05:10:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 05:10:39,591 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 05:10:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 05:10:39,592 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 05:10:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 05:10:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 05:10:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 05:10:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 05:10:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 05:10:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 05:10:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 05:10:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-18 05:10:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-18 05:10:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-18 05:10:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-18 05:10:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-18 05:10:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 05:10:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 05:10:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 05:10:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 05:10:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 05:10:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 05:10:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 05:10:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 05:10:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 05:10:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 05:10:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 05:10:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 05:10:39,600 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 05:10:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 05:10:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 05:10:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 05:10:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 05:10:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 05:10:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 05:10:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 05:10:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 05:10:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 05:10:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 05:10:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 05:10:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 05:10:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 05:10:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 05:10:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 05:10:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 05:10:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 05:10:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 05:10:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 05:10:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 05:10:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 05:10:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 05:10:39,605 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 05:10:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 05:10:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 05:10:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 05:10:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 05:10:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 05:10:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 05:10:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 05:10:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 05:10:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2020-07-18 05:10:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 05:10:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 05:10:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2020-07-18 05:10:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 05:10:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 05:10:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 05:10:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:10:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 05:10:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:10:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:10:40,307 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:10:40,308 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 05:10:40,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:10:40 BoogieIcfgContainer [2020-07-18 05:10:40,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:10:40,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:10:40,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:10:40,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:10:40,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:10:38" (1/3) ... [2020-07-18 05:10:40,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:10:40, skipping insertion in model container [2020-07-18 05:10:40,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:10:39" (2/3) ... [2020-07-18 05:10:40,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:10:40, skipping insertion in model container [2020-07-18 05:10:40,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:10:40" (3/3) ... [2020-07-18 05:10:40,321 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2020-07-18 05:10:40,332 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:10:40,339 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 05:10:40,353 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 05:10:40,373 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:10:40,374 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:10:40,374 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:10:40,374 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:10:40,374 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:10:40,375 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:10:40,375 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:10:40,375 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:10:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-07-18 05:10:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-18 05:10:40,405 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:10:40,406 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:40,407 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:10:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:10:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash 42223880, now seen corresponding path program 1 times [2020-07-18 05:10:40,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:10:40,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [749841138] [2020-07-18 05:10:40,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:10:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:40,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {139#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID [2020-07-18 05:10:40,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-18 05:10:40,825 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-18 05:10:40,825 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~head~0.base, ~head~0.offset := 0, 0; {79#true} is VALID [2020-07-18 05:10:40,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 05:10:40,826 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {79#true} {79#true} #138#return; {79#true} is VALID [2020-07-18 05:10:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:40,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID [2020-07-18 05:10:40,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID [2020-07-18 05:10:40,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {141#(not (= |insert_list_#t~malloc5.base| 0))} is VALID [2020-07-18 05:10:40,942 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#(not (= |insert_list_#t~malloc5.base| 0))} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {142#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:40,943 INFO L280 TraceCheckUtils]: 4: Hoare triple {142#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {142#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:40,943 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0; {142#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:40,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {142#(not (= 0 insert_list_~l.base))} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {142#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:40,945 INFO L280 TraceCheckUtils]: 7: Hoare triple {142#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:40,946 INFO L280 TraceCheckUtils]: 8: Hoare triple {98#(not (= 0 ~head~0.base))} #res := 0; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:40,947 INFO L280 TraceCheckUtils]: 9: Hoare triple {98#(not (= 0 ~head~0.base))} assume true; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:40,949 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {98#(not (= 0 ~head~0.base))} {79#true} #126#return; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:41,010 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,011 INFO L280 TraceCheckUtils]: 1: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} ~k := #in~k; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,011 INFO L280 TraceCheckUtils]: 2: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,012 INFO L280 TraceCheckUtils]: 3: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,013 INFO L280 TraceCheckUtils]: 4: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,014 INFO L280 TraceCheckUtils]: 5: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0; {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,014 INFO L280 TraceCheckUtils]: 6: Hoare triple {144#(= 0 |old(~head~0.base)|)} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,015 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {144#(= 0 |old(~head~0.base)|)} #res := 0; {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,017 INFO L280 TraceCheckUtils]: 9: Hoare triple {144#(= 0 |old(~head~0.base)|)} assume true; {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,018 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {144#(= 0 |old(~head~0.base)|)} {98#(not (= 0 ~head~0.base))} #128#return; {80#false} is VALID [2020-07-18 05:10:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:41,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID [2020-07-18 05:10:41,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID [2020-07-18 05:10:41,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {79#true} is VALID [2020-07-18 05:10:41,047 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {79#true} is VALID [2020-07-18 05:10:41,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {79#true} is VALID [2020-07-18 05:10:41,047 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {79#true} is VALID [2020-07-18 05:10:41,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {79#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {79#true} is VALID [2020-07-18 05:10:41,048 INFO L280 TraceCheckUtils]: 7: Hoare triple {79#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {79#true} is VALID [2020-07-18 05:10:41,048 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} #res := 0; {79#true} is VALID [2020-07-18 05:10:41,048 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 05:10:41,048 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {79#true} {80#false} #130#return; {80#false} is VALID [2020-07-18 05:10:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:41,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID [2020-07-18 05:10:41,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID [2020-07-18 05:10:41,078 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {79#true} is VALID [2020-07-18 05:10:41,078 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {79#true} is VALID [2020-07-18 05:10:41,078 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {79#true} is VALID [2020-07-18 05:10:41,079 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {79#true} is VALID [2020-07-18 05:10:41,079 INFO L280 TraceCheckUtils]: 6: Hoare triple {79#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {79#true} is VALID [2020-07-18 05:10:41,079 INFO L280 TraceCheckUtils]: 7: Hoare triple {79#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {79#true} is VALID [2020-07-18 05:10:41,079 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} #res := 0; {79#true} is VALID [2020-07-18 05:10:41,080 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 05:10:41,080 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {79#true} {80#false} #132#return; {80#false} is VALID [2020-07-18 05:10:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:41,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {79#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID [2020-07-18 05:10:41,092 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID [2020-07-18 05:10:41,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {79#true} is VALID [2020-07-18 05:10:41,093 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} assume !true; {80#false} is VALID [2020-07-18 05:10:41,094 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#false} #res.base, #res.offset := ~l.base, ~l.offset; {80#false} is VALID [2020-07-18 05:10:41,094 INFO L280 TraceCheckUtils]: 5: Hoare triple {80#false} assume true; {80#false} is VALID [2020-07-18 05:10:41,095 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {80#false} {80#false} #134#return; {80#false} is VALID [2020-07-18 05:10:41,096 INFO L263 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {139#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:10:41,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {139#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID [2020-07-18 05:10:41,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-18 05:10:41,097 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-18 05:10:41,097 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} ~head~0.base, ~head~0.offset := 0, 0; {79#true} is VALID [2020-07-18 05:10:41,098 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 05:10:41,098 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {79#true} {79#true} #138#return; {79#true} is VALID [2020-07-18 05:10:41,098 INFO L263 TraceCheckUtils]: 7: Hoare triple {79#true} call #t~ret13 := main(); {79#true} is VALID [2020-07-18 05:10:41,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} havoc ~i~0; {79#true} is VALID [2020-07-18 05:10:41,099 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} havoc ~mylist~0.base, ~mylist~0.offset; {79#true} is VALID [2020-07-18 05:10:41,099 INFO L280 TraceCheckUtils]: 10: Hoare triple {79#true} havoc ~temp~0.base, ~temp~0.offset; {79#true} is VALID [2020-07-18 05:10:41,101 INFO L263 TraceCheckUtils]: 11: Hoare triple {79#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:10:41,102 INFO L280 TraceCheckUtils]: 12: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID [2020-07-18 05:10:41,102 INFO L280 TraceCheckUtils]: 13: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID [2020-07-18 05:10:41,103 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {141#(not (= |insert_list_#t~malloc5.base| 0))} is VALID [2020-07-18 05:10:41,105 INFO L280 TraceCheckUtils]: 15: Hoare triple {141#(not (= |insert_list_#t~malloc5.base| 0))} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {142#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:41,106 INFO L280 TraceCheckUtils]: 16: Hoare triple {142#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {142#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:41,107 INFO L280 TraceCheckUtils]: 17: Hoare triple {142#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0; {142#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:41,108 INFO L280 TraceCheckUtils]: 18: Hoare triple {142#(not (= 0 insert_list_~l.base))} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {142#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:41,109 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:41,110 INFO L280 TraceCheckUtils]: 20: Hoare triple {98#(not (= 0 ~head~0.base))} #res := 0; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:41,110 INFO L280 TraceCheckUtils]: 21: Hoare triple {98#(not (= 0 ~head~0.base))} assume true; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:41,112 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {98#(not (= 0 ~head~0.base))} {79#true} #126#return; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:41,113 INFO L280 TraceCheckUtils]: 23: Hoare triple {98#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:41,114 INFO L280 TraceCheckUtils]: 24: Hoare triple {98#(not (= 0 ~head~0.base))} havoc #t~ret6; {98#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:41,116 INFO L263 TraceCheckUtils]: 25: Hoare triple {98#(not (= 0 ~head~0.base))} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:10:41,118 INFO L280 TraceCheckUtils]: 26: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,119 INFO L280 TraceCheckUtils]: 27: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} ~k := #in~k; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,120 INFO L280 TraceCheckUtils]: 28: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,121 INFO L280 TraceCheckUtils]: 29: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,122 INFO L280 TraceCheckUtils]: 30: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {143#(= |old(~head~0.base)| ~head~0.base)} is VALID [2020-07-18 05:10:41,123 INFO L280 TraceCheckUtils]: 31: Hoare triple {143#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0; {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,124 INFO L280 TraceCheckUtils]: 32: Hoare triple {144#(= 0 |old(~head~0.base)|)} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,125 INFO L280 TraceCheckUtils]: 33: Hoare triple {144#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,126 INFO L280 TraceCheckUtils]: 34: Hoare triple {144#(= 0 |old(~head~0.base)|)} #res := 0; {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,128 INFO L280 TraceCheckUtils]: 35: Hoare triple {144#(= 0 |old(~head~0.base)|)} assume true; {144#(= 0 |old(~head~0.base)|)} is VALID [2020-07-18 05:10:41,130 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {144#(= 0 |old(~head~0.base)|)} {98#(not (= 0 ~head~0.base))} #128#return; {80#false} is VALID [2020-07-18 05:10:41,131 INFO L280 TraceCheckUtils]: 37: Hoare triple {80#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {80#false} is VALID [2020-07-18 05:10:41,131 INFO L280 TraceCheckUtils]: 38: Hoare triple {80#false} havoc #t~ret7; {80#false} is VALID [2020-07-18 05:10:41,131 INFO L263 TraceCheckUtils]: 39: Hoare triple {80#false} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:10:41,132 INFO L280 TraceCheckUtils]: 40: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID [2020-07-18 05:10:41,132 INFO L280 TraceCheckUtils]: 41: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID [2020-07-18 05:10:41,132 INFO L280 TraceCheckUtils]: 42: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {79#true} is VALID [2020-07-18 05:10:41,133 INFO L280 TraceCheckUtils]: 43: Hoare triple {79#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {79#true} is VALID [2020-07-18 05:10:41,133 INFO L280 TraceCheckUtils]: 44: Hoare triple {79#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {79#true} is VALID [2020-07-18 05:10:41,133 INFO L280 TraceCheckUtils]: 45: Hoare triple {79#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {79#true} is VALID [2020-07-18 05:10:41,134 INFO L280 TraceCheckUtils]: 46: Hoare triple {79#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {79#true} is VALID [2020-07-18 05:10:41,134 INFO L280 TraceCheckUtils]: 47: Hoare triple {79#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {79#true} is VALID [2020-07-18 05:10:41,134 INFO L280 TraceCheckUtils]: 48: Hoare triple {79#true} #res := 0; {79#true} is VALID [2020-07-18 05:10:41,134 INFO L280 TraceCheckUtils]: 49: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 05:10:41,135 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {79#true} {80#false} #130#return; {80#false} is VALID [2020-07-18 05:10:41,135 INFO L280 TraceCheckUtils]: 51: Hoare triple {80#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {80#false} is VALID [2020-07-18 05:10:41,135 INFO L280 TraceCheckUtils]: 52: Hoare triple {80#false} havoc #t~ret8; {80#false} is VALID [2020-07-18 05:10:41,136 INFO L263 TraceCheckUtils]: 53: Hoare triple {80#false} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:10:41,136 INFO L280 TraceCheckUtils]: 54: Hoare triple {140#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID [2020-07-18 05:10:41,136 INFO L280 TraceCheckUtils]: 55: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID [2020-07-18 05:10:41,137 INFO L280 TraceCheckUtils]: 56: Hoare triple {79#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {79#true} is VALID [2020-07-18 05:10:41,137 INFO L280 TraceCheckUtils]: 57: Hoare triple {79#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {79#true} is VALID [2020-07-18 05:10:41,137 INFO L280 TraceCheckUtils]: 58: Hoare triple {79#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {79#true} is VALID [2020-07-18 05:10:41,138 INFO L280 TraceCheckUtils]: 59: Hoare triple {79#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {79#true} is VALID [2020-07-18 05:10:41,138 INFO L280 TraceCheckUtils]: 60: Hoare triple {79#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {79#true} is VALID [2020-07-18 05:10:41,138 INFO L280 TraceCheckUtils]: 61: Hoare triple {79#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {79#true} is VALID [2020-07-18 05:10:41,138 INFO L280 TraceCheckUtils]: 62: Hoare triple {79#true} #res := 0; {79#true} is VALID [2020-07-18 05:10:41,139 INFO L280 TraceCheckUtils]: 63: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 05:10:41,139 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {79#true} {80#false} #132#return; {80#false} is VALID [2020-07-18 05:10:41,139 INFO L280 TraceCheckUtils]: 65: Hoare triple {80#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {80#false} is VALID [2020-07-18 05:10:41,140 INFO L280 TraceCheckUtils]: 66: Hoare triple {80#false} havoc #t~ret9; {80#false} is VALID [2020-07-18 05:10:41,140 INFO L263 TraceCheckUtils]: 67: Hoare triple {80#false} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {79#true} is VALID [2020-07-18 05:10:41,140 INFO L280 TraceCheckUtils]: 68: Hoare triple {79#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {79#true} is VALID [2020-07-18 05:10:41,141 INFO L280 TraceCheckUtils]: 69: Hoare triple {79#true} ~k := #in~k; {79#true} is VALID [2020-07-18 05:10:41,141 INFO L280 TraceCheckUtils]: 70: Hoare triple {79#true} ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {79#true} is VALID [2020-07-18 05:10:41,142 INFO L280 TraceCheckUtils]: 71: Hoare triple {79#true} assume !true; {80#false} is VALID [2020-07-18 05:10:41,142 INFO L280 TraceCheckUtils]: 72: Hoare triple {80#false} #res.base, #res.offset := ~l.base, ~l.offset; {80#false} is VALID [2020-07-18 05:10:41,142 INFO L280 TraceCheckUtils]: 73: Hoare triple {80#false} assume true; {80#false} is VALID [2020-07-18 05:10:41,143 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {80#false} {80#false} #134#return; {80#false} is VALID [2020-07-18 05:10:41,143 INFO L280 TraceCheckUtils]: 75: Hoare triple {80#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset; {80#false} is VALID [2020-07-18 05:10:41,143 INFO L280 TraceCheckUtils]: 76: Hoare triple {80#false} havoc #t~ret10.base, #t~ret10.offset; {80#false} is VALID [2020-07-18 05:10:41,144 INFO L280 TraceCheckUtils]: 77: Hoare triple {80#false} SUMMARY for call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); srcloc: L550 {80#false} is VALID [2020-07-18 05:10:41,144 INFO L263 TraceCheckUtils]: 78: Hoare triple {80#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {80#false} is VALID [2020-07-18 05:10:41,144 INFO L280 TraceCheckUtils]: 79: Hoare triple {80#false} ~cond := #in~cond; {80#false} is VALID [2020-07-18 05:10:41,145 INFO L280 TraceCheckUtils]: 80: Hoare triple {80#false} assume 0 == ~cond; {80#false} is VALID [2020-07-18 05:10:41,145 INFO L280 TraceCheckUtils]: 81: Hoare triple {80#false} assume !false; {80#false} is VALID [2020-07-18 05:10:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-18 05:10:41,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [749841138] [2020-07-18 05:10:41,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:10:41,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 05:10:41,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135317874] [2020-07-18 05:10:41,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-07-18 05:10:41,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:10:41,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 05:10:41,282 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:10:41,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 05:10:41,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:10:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 05:10:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-18 05:10:41,296 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 9 states. [2020-07-18 05:10:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:10:43,404 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2020-07-18 05:10:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-18 05:10:43,405 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2020-07-18 05:10:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:10:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 05:10:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 225 transitions. [2020-07-18 05:10:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 05:10:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 225 transitions. [2020-07-18 05:10:43,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 225 transitions. [2020-07-18 05:10:43,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:10:43,763 INFO L225 Difference]: With dead ends: 187 [2020-07-18 05:10:43,763 INFO L226 Difference]: Without dead ends: 92 [2020-07-18 05:10:43,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-07-18 05:10:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-18 05:10:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2020-07-18 05:10:44,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:10:44,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 73 states. [2020-07-18 05:10:44,011 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 73 states. [2020-07-18 05:10:44,012 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 73 states. [2020-07-18 05:10:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:10:44,021 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-18 05:10:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-18 05:10:44,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:10:44,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:10:44,025 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 92 states. [2020-07-18 05:10:44,027 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 92 states. [2020-07-18 05:10:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:10:44,046 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-18 05:10:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-18 05:10:44,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:10:44,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:10:44,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:10:44,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:10:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-18 05:10:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-07-18 05:10:44,066 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 82 [2020-07-18 05:10:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:10:44,067 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-07-18 05:10:44,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 05:10:44,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 78 transitions. [2020-07-18 05:10:44,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:10:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-07-18 05:10:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-07-18 05:10:44,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:10:44,198 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2020-07-18 05:10:44,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:10:44,199 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:10:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:10:44,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1050718625, now seen corresponding path program 1 times [2020-07-18 05:10:44,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:10:44,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [10798215] [2020-07-18 05:10:44,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:10:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:44,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {944#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {877#true} is VALID [2020-07-18 05:10:44,330 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} #valid := #valid[0 := 0]; {877#true} is VALID [2020-07-18 05:10:44,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} assume 0 < #StackHeapBarrier; {877#true} is VALID [2020-07-18 05:10:44,331 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} ~head~0.base, ~head~0.offset := 0, 0; {877#true} is VALID [2020-07-18 05:10:44,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} assume true; {877#true} is VALID [2020-07-18 05:10:44,331 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {877#true} {877#true} #138#return; {877#true} is VALID [2020-07-18 05:10:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:44,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,370 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID [2020-07-18 05:10:44,371 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID [2020-07-18 05:10:44,371 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID [2020-07-18 05:10:44,371 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {877#true} is VALID [2020-07-18 05:10:44,372 INFO L280 TraceCheckUtils]: 6: Hoare triple {877#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {877#true} is VALID [2020-07-18 05:10:44,372 INFO L280 TraceCheckUtils]: 7: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID [2020-07-18 05:10:44,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} #res := 0; {877#true} is VALID [2020-07-18 05:10:44,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2020-07-18 05:10:44,373 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #126#return; {877#true} is VALID [2020-07-18 05:10:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:44,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID [2020-07-18 05:10:44,384 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID [2020-07-18 05:10:44,385 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID [2020-07-18 05:10:44,385 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume !(~head~0.base == 0 && ~head~0.offset == 0); {877#true} is VALID [2020-07-18 05:10:44,385 INFO L280 TraceCheckUtils]: 6: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {877#true} is VALID [2020-07-18 05:10:44,386 INFO L280 TraceCheckUtils]: 7: Hoare triple {877#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {877#true} is VALID [2020-07-18 05:10:44,386 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID [2020-07-18 05:10:44,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {877#true} #res := 0; {877#true} is VALID [2020-07-18 05:10:44,387 INFO L280 TraceCheckUtils]: 10: Hoare triple {877#true} assume true; {877#true} is VALID [2020-07-18 05:10:44,387 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {877#true} {877#true} #128#return; {877#true} is VALID [2020-07-18 05:10:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:44,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID [2020-07-18 05:10:44,399 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID [2020-07-18 05:10:44,399 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID [2020-07-18 05:10:44,399 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume !(~head~0.base == 0 && ~head~0.offset == 0); {877#true} is VALID [2020-07-18 05:10:44,400 INFO L280 TraceCheckUtils]: 6: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {877#true} is VALID [2020-07-18 05:10:44,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {877#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {877#true} is VALID [2020-07-18 05:10:44,400 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID [2020-07-18 05:10:44,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {877#true} #res := 0; {877#true} is VALID [2020-07-18 05:10:44,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {877#true} assume true; {877#true} is VALID [2020-07-18 05:10:44,401 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {877#true} {877#true} #130#return; {877#true} is VALID [2020-07-18 05:10:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:44,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {946#(not (= |insert_list_#t~malloc5.base| 0))} is VALID [2020-07-18 05:10:44,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {946#(not (= |insert_list_#t~malloc5.base| 0))} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,449 INFO L280 TraceCheckUtils]: 4: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,450 INFO L280 TraceCheckUtils]: 5: Hoare triple {947#(not (= 0 insert_list_~l.base))} assume !(~head~0.base == 0 && ~head~0.offset == 0); {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,452 INFO L280 TraceCheckUtils]: 8: Hoare triple {947#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,478 INFO L280 TraceCheckUtils]: 9: Hoare triple {932#(not (= 0 ~head~0.base))} #res := 0; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,478 INFO L280 TraceCheckUtils]: 10: Hoare triple {932#(not (= 0 ~head~0.base))} assume true; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,479 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {932#(not (= 0 ~head~0.base))} {877#true} #132#return; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:44,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {877#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {948#(= search_list_~l.base ~head~0.base)} is VALID [2020-07-18 05:10:44,531 INFO L280 TraceCheckUtils]: 3: Hoare triple {948#(= search_list_~l.base ~head~0.base)} #t~short3 := ~l.base != 0 || ~l.offset != 0; {949#(or (= 0 ~head~0.base) |search_list_#t~short3|)} is VALID [2020-07-18 05:10:44,531 INFO L280 TraceCheckUtils]: 4: Hoare triple {949#(or (= 0 ~head~0.base) |search_list_#t~short3|)} assume !#t~short3; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {950#(= 0 ~head~0.base)} assume !#t~short3; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {950#(= 0 ~head~0.base)} havoc #t~short3; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,533 INFO L280 TraceCheckUtils]: 7: Hoare triple {950#(= 0 ~head~0.base)} havoc #t~mem2; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {950#(= 0 ~head~0.base)} #res.base, #res.offset := ~l.base, ~l.offset; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,534 INFO L280 TraceCheckUtils]: 9: Hoare triple {950#(= 0 ~head~0.base)} assume true; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,536 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {950#(= 0 ~head~0.base)} {932#(not (= 0 ~head~0.base))} #134#return; {878#false} is VALID [2020-07-18 05:10:44,537 INFO L263 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {944#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:10:44,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {944#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~head~0.base |old(~head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {877#true} is VALID [2020-07-18 05:10:44,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {877#true} #valid := #valid[0 := 0]; {877#true} is VALID [2020-07-18 05:10:44,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {877#true} assume 0 < #StackHeapBarrier; {877#true} is VALID [2020-07-18 05:10:44,538 INFO L280 TraceCheckUtils]: 4: Hoare triple {877#true} ~head~0.base, ~head~0.offset := 0, 0; {877#true} is VALID [2020-07-18 05:10:44,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#true} assume true; {877#true} is VALID [2020-07-18 05:10:44,539 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {877#true} {877#true} #138#return; {877#true} is VALID [2020-07-18 05:10:44,539 INFO L263 TraceCheckUtils]: 7: Hoare triple {877#true} call #t~ret13 := main(); {877#true} is VALID [2020-07-18 05:10:44,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#true} havoc ~i~0; {877#true} is VALID [2020-07-18 05:10:44,539 INFO L280 TraceCheckUtils]: 9: Hoare triple {877#true} havoc ~mylist~0.base, ~mylist~0.offset; {877#true} is VALID [2020-07-18 05:10:44,540 INFO L280 TraceCheckUtils]: 10: Hoare triple {877#true} havoc ~temp~0.base, ~temp~0.offset; {877#true} is VALID [2020-07-18 05:10:44,541 INFO L263 TraceCheckUtils]: 11: Hoare triple {877#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:10:44,542 INFO L280 TraceCheckUtils]: 12: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,542 INFO L280 TraceCheckUtils]: 13: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,542 INFO L280 TraceCheckUtils]: 14: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID [2020-07-18 05:10:44,542 INFO L280 TraceCheckUtils]: 15: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID [2020-07-18 05:10:44,543 INFO L280 TraceCheckUtils]: 16: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID [2020-07-18 05:10:44,543 INFO L280 TraceCheckUtils]: 17: Hoare triple {877#true} assume ~head~0.base == 0 && ~head~0.offset == 0; {877#true} is VALID [2020-07-18 05:10:44,543 INFO L280 TraceCheckUtils]: 18: Hoare triple {877#true} SUMMARY for call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); srcloc: L534 {877#true} is VALID [2020-07-18 05:10:44,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID [2020-07-18 05:10:44,544 INFO L280 TraceCheckUtils]: 20: Hoare triple {877#true} #res := 0; {877#true} is VALID [2020-07-18 05:10:44,544 INFO L280 TraceCheckUtils]: 21: Hoare triple {877#true} assume true; {877#true} is VALID [2020-07-18 05:10:44,544 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {877#true} {877#true} #126#return; {877#true} is VALID [2020-07-18 05:10:44,544 INFO L280 TraceCheckUtils]: 23: Hoare triple {877#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; {877#true} is VALID [2020-07-18 05:10:44,545 INFO L280 TraceCheckUtils]: 24: Hoare triple {877#true} havoc #t~ret6; {877#true} is VALID [2020-07-18 05:10:44,546 INFO L263 TraceCheckUtils]: 25: Hoare triple {877#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:10:44,546 INFO L280 TraceCheckUtils]: 26: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,547 INFO L280 TraceCheckUtils]: 27: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,547 INFO L280 TraceCheckUtils]: 28: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID [2020-07-18 05:10:44,547 INFO L280 TraceCheckUtils]: 29: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID [2020-07-18 05:10:44,547 INFO L280 TraceCheckUtils]: 30: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID [2020-07-18 05:10:44,548 INFO L280 TraceCheckUtils]: 31: Hoare triple {877#true} assume !(~head~0.base == 0 && ~head~0.offset == 0); {877#true} is VALID [2020-07-18 05:10:44,548 INFO L280 TraceCheckUtils]: 32: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {877#true} is VALID [2020-07-18 05:10:44,548 INFO L280 TraceCheckUtils]: 33: Hoare triple {877#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {877#true} is VALID [2020-07-18 05:10:44,549 INFO L280 TraceCheckUtils]: 34: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID [2020-07-18 05:10:44,549 INFO L280 TraceCheckUtils]: 35: Hoare triple {877#true} #res := 0; {877#true} is VALID [2020-07-18 05:10:44,549 INFO L280 TraceCheckUtils]: 36: Hoare triple {877#true} assume true; {877#true} is VALID [2020-07-18 05:10:44,549 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {877#true} {877#true} #128#return; {877#true} is VALID [2020-07-18 05:10:44,550 INFO L280 TraceCheckUtils]: 38: Hoare triple {877#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {877#true} is VALID [2020-07-18 05:10:44,550 INFO L280 TraceCheckUtils]: 39: Hoare triple {877#true} havoc #t~ret7; {877#true} is VALID [2020-07-18 05:10:44,551 INFO L263 TraceCheckUtils]: 40: Hoare triple {877#true} call #t~ret8 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:10:44,552 INFO L280 TraceCheckUtils]: 41: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,552 INFO L280 TraceCheckUtils]: 42: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,552 INFO L280 TraceCheckUtils]: 43: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {877#true} is VALID [2020-07-18 05:10:44,553 INFO L280 TraceCheckUtils]: 44: Hoare triple {877#true} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {877#true} is VALID [2020-07-18 05:10:44,553 INFO L280 TraceCheckUtils]: 45: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {877#true} is VALID [2020-07-18 05:10:44,553 INFO L280 TraceCheckUtils]: 46: Hoare triple {877#true} assume !(~head~0.base == 0 && ~head~0.offset == 0); {877#true} is VALID [2020-07-18 05:10:44,553 INFO L280 TraceCheckUtils]: 47: Hoare triple {877#true} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {877#true} is VALID [2020-07-18 05:10:44,554 INFO L280 TraceCheckUtils]: 48: Hoare triple {877#true} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {877#true} is VALID [2020-07-18 05:10:44,554 INFO L280 TraceCheckUtils]: 49: Hoare triple {877#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {877#true} is VALID [2020-07-18 05:10:44,554 INFO L280 TraceCheckUtils]: 50: Hoare triple {877#true} #res := 0; {877#true} is VALID [2020-07-18 05:10:44,554 INFO L280 TraceCheckUtils]: 51: Hoare triple {877#true} assume true; {877#true} is VALID [2020-07-18 05:10:44,555 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {877#true} {877#true} #130#return; {877#true} is VALID [2020-07-18 05:10:44,555 INFO L280 TraceCheckUtils]: 53: Hoare triple {877#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {877#true} is VALID [2020-07-18 05:10:44,555 INFO L280 TraceCheckUtils]: 54: Hoare triple {877#true} havoc #t~ret8; {877#true} is VALID [2020-07-18 05:10:44,557 INFO L263 TraceCheckUtils]: 55: Hoare triple {877#true} call #t~ret9 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 05:10:44,557 INFO L280 TraceCheckUtils]: 56: Hoare triple {945#(and (= ~head~0.offset |old(~head~0.offset)|) (= |#valid| |old(#valid)|) (= ~head~0.base |old(~head~0.base)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,557 INFO L280 TraceCheckUtils]: 57: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,558 INFO L280 TraceCheckUtils]: 58: Hoare triple {877#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(8); srcloc: L531 {946#(not (= |insert_list_#t~malloc5.base| 0))} is VALID [2020-07-18 05:10:44,559 INFO L280 TraceCheckUtils]: 59: Hoare triple {946#(not (= |insert_list_#t~malloc5.base| 0))} ~l.base, ~l.offset := #t~malloc5.base, #t~malloc5.offset; {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,560 INFO L280 TraceCheckUtils]: 60: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L532 {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,560 INFO L280 TraceCheckUtils]: 61: Hoare triple {947#(not (= 0 insert_list_~l.base))} assume !(~head~0.base == 0 && ~head~0.offset == 0); {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,561 INFO L280 TraceCheckUtils]: 62: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~int(~k, ~l.base, ~l.offset, 4); srcloc: L536 {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,561 INFO L280 TraceCheckUtils]: 63: Hoare triple {947#(not (= 0 insert_list_~l.base))} SUMMARY for call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); srcloc: L536-1 {947#(not (= 0 insert_list_~l.base))} is VALID [2020-07-18 05:10:44,562 INFO L280 TraceCheckUtils]: 64: Hoare triple {947#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,563 INFO L280 TraceCheckUtils]: 65: Hoare triple {932#(not (= 0 ~head~0.base))} #res := 0; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,563 INFO L280 TraceCheckUtils]: 66: Hoare triple {932#(not (= 0 ~head~0.base))} assume true; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,564 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {932#(not (= 0 ~head~0.base))} {877#true} #132#return; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,565 INFO L280 TraceCheckUtils]: 68: Hoare triple {932#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,565 INFO L280 TraceCheckUtils]: 69: Hoare triple {932#(not (= 0 ~head~0.base))} havoc #t~ret9; {932#(not (= 0 ~head~0.base))} is VALID [2020-07-18 05:10:44,566 INFO L263 TraceCheckUtils]: 70: Hoare triple {932#(not (= 0 ~head~0.base))} call #t~ret10.base, #t~ret10.offset := search_list(~head~0.base, ~head~0.offset, 2); {877#true} is VALID [2020-07-18 05:10:44,566 INFO L280 TraceCheckUtils]: 71: Hoare triple {877#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset; {877#true} is VALID [2020-07-18 05:10:44,566 INFO L280 TraceCheckUtils]: 72: Hoare triple {877#true} ~k := #in~k; {877#true} is VALID [2020-07-18 05:10:44,567 INFO L280 TraceCheckUtils]: 73: Hoare triple {877#true} ~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {948#(= search_list_~l.base ~head~0.base)} is VALID [2020-07-18 05:10:44,568 INFO L280 TraceCheckUtils]: 74: Hoare triple {948#(= search_list_~l.base ~head~0.base)} #t~short3 := ~l.base != 0 || ~l.offset != 0; {949#(or (= 0 ~head~0.base) |search_list_#t~short3|)} is VALID [2020-07-18 05:10:44,568 INFO L280 TraceCheckUtils]: 75: Hoare triple {949#(or (= 0 ~head~0.base) |search_list_#t~short3|)} assume !#t~short3; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,569 INFO L280 TraceCheckUtils]: 76: Hoare triple {950#(= 0 ~head~0.base)} assume !#t~short3; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,569 INFO L280 TraceCheckUtils]: 77: Hoare triple {950#(= 0 ~head~0.base)} havoc #t~short3; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,570 INFO L280 TraceCheckUtils]: 78: Hoare triple {950#(= 0 ~head~0.base)} havoc #t~mem2; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,571 INFO L280 TraceCheckUtils]: 79: Hoare triple {950#(= 0 ~head~0.base)} #res.base, #res.offset := ~l.base, ~l.offset; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,571 INFO L280 TraceCheckUtils]: 80: Hoare triple {950#(= 0 ~head~0.base)} assume true; {950#(= 0 ~head~0.base)} is VALID [2020-07-18 05:10:44,572 INFO L275 TraceCheckUtils]: 81: Hoare quadruple {950#(= 0 ~head~0.base)} {932#(not (= 0 ~head~0.base))} #134#return; {878#false} is VALID [2020-07-18 05:10:44,573 INFO L280 TraceCheckUtils]: 82: Hoare triple {878#false} ~temp~0.base, ~temp~0.offset := #t~ret10.base, #t~ret10.offset; {878#false} is VALID [2020-07-18 05:10:44,573 INFO L280 TraceCheckUtils]: 83: Hoare triple {878#false} havoc #t~ret10.base, #t~ret10.offset; {878#false} is VALID [2020-07-18 05:10:44,573 INFO L280 TraceCheckUtils]: 84: Hoare triple {878#false} SUMMARY for call #t~mem11 := read~int(~temp~0.base, ~temp~0.offset, 4); srcloc: L550 {878#false} is VALID [2020-07-18 05:10:44,574 INFO L263 TraceCheckUtils]: 85: Hoare triple {878#false} call __VERIFIER_assert((if 1 == #t~mem11 then 1 else 0)); {878#false} is VALID [2020-07-18 05:10:44,574 INFO L280 TraceCheckUtils]: 86: Hoare triple {878#false} ~cond := #in~cond; {878#false} is VALID [2020-07-18 05:10:44,574 INFO L280 TraceCheckUtils]: 87: Hoare triple {878#false} assume 0 == ~cond; {878#false} is VALID [2020-07-18 05:10:44,574 INFO L280 TraceCheckUtils]: 88: Hoare triple {878#false} assume !false; {878#false} is VALID [2020-07-18 05:10:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-07-18 05:10:44,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [10798215] [2020-07-18 05:10:44,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:10:44,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 05:10:44,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484544805] [2020-07-18 05:10:44,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2020-07-18 05:10:44,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:10:44,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 05:10:44,665 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:10:44,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 05:10:44,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:10:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 05:10:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-18 05:10:44,667 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 10 states. [2020-07-18 05:10:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:10:46,386 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2020-07-18 05:10:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-18 05:10:46,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2020-07-18 05:10:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:10:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 05:10:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 117 transitions. [2020-07-18 05:10:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 05:10:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 117 transitions. [2020-07-18 05:10:46,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 117 transitions. [2020-07-18 05:10:46,600 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:10:46,604 INFO L225 Difference]: With dead ends: 113 [2020-07-18 05:10:46,605 INFO L226 Difference]: Without dead ends: 90 [2020-07-18 05:10:46,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2020-07-18 05:10:46,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-18 05:10:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2020-07-18 05:10:46,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:10:46,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 75 states. [2020-07-18 05:10:46,822 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 75 states. [2020-07-18 05:10:46,822 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 75 states. [2020-07-18 05:10:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:10:46,828 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2020-07-18 05:10:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2020-07-18 05:10:46,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:10:46,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:10:46,829 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 90 states. [2020-07-18 05:10:46,830 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 90 states. [2020-07-18 05:10:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:10:46,835 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2020-07-18 05:10:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2020-07-18 05:10:46,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:10:46,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:10:46,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:10:46,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:10:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-18 05:10:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-07-18 05:10:46,840 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 89 [2020-07-18 05:10:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:10:46,840 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-07-18 05:10:46,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 05:10:46,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 80 transitions. [2020-07-18 05:10:46,976 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:10:46,976 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-07-18 05:10:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-18 05:10:46,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:10:46,982 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:10:46,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:10:46,983 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:10:46,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:10:46,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1346991358, now seen corresponding path program 1 times [2020-07-18 05:10:46,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:10:46,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [129567295] [2020-07-18 05:10:46,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:10:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:47,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:10:47,077 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.interpolateCongruence(CCInterpolator.java:300) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.computeInterpolants(CCInterpolator.java:415) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:297) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:279) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:135) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:236) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:213) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:874) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:239) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 05:10:47,084 INFO L168 Benchmark]: Toolchain (without parser) took 8297.18 ms. Allocated memory was 137.9 MB in the beginning and 318.8 MB in the end (delta: 180.9 MB). Free memory was 102.4 MB in the beginning and 196.2 MB in the end (delta: -93.8 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2020-07-18 05:10:47,085 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 05:10:47,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.84 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 102.0 MB in the beginning and 168.6 MB in the end (delta: -66.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-07-18 05:10:47,090 INFO L168 Benchmark]: Boogie Preprocessor took 70.61 ms. Allocated memory is still 203.4 MB. Free memory was 168.6 MB in the beginning and 165.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-18 05:10:47,092 INFO L168 Benchmark]: RCFGBuilder took 791.32 ms. Allocated memory is still 203.4 MB. Free memory was 165.2 MB in the beginning and 102.9 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. [2020-07-18 05:10:47,093 INFO L168 Benchmark]: TraceAbstraction took 6766.86 ms. Allocated memory was 203.4 MB in the beginning and 318.8 MB in the end (delta: 115.3 MB). Free memory was 102.9 MB in the beginning and 196.2 MB in the end (delta: -93.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2020-07-18 05:10:47,106 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 661.84 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 102.0 MB in the beginning and 168.6 MB in the end (delta: -66.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.61 ms. Allocated memory is still 203.4 MB. Free memory was 168.6 MB in the beginning and 165.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.32 ms. Allocated memory is still 203.4 MB. Free memory was 165.2 MB in the beginning and 102.9 MB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6766.86 ms. Allocated memory was 203.4 MB in the beginning and 318.8 MB in the end (delta: 115.3 MB). Free memory was 102.9 MB in the beginning and 196.2 MB in the end (delta: -93.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.interpolateCongruence(CCInterpolator.java:300) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...