java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:28:02,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:28:02,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:28:02,374 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:28:02,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:28:02,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:28:02,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:28:02,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:28:02,380 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:28:02,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:28:02,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:28:02,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:28:02,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:28:02,384 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:28:02,386 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:28:02,386 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:28:02,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:28:02,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:28:02,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:28:02,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:28:02,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:28:02,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:28:02,415 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:28:02,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:28:02,416 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:28:02,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:28:02,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:28:02,422 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:28:02,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:28:02,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:28:02,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:28:02,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:28:02,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:28:02,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:28:02,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:28:02,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:28:02,432 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:28:02,453 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:28:02,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:28:02,454 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:28:02,454 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:28:02,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:28:02,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:28:02,455 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:28:02,456 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:28:02,456 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:28:02,456 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:28:02,456 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:28:02,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:28:02,457 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:28:02,457 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:28:02,457 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:28:02,457 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:28:02,458 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:28:02,458 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:28:02,458 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:28:02,458 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:28:02,458 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:28:02,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:28:02,459 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:28:02,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:28:02,459 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:28:02,460 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:28:02,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:28:02,460 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:28:02,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:28:02,461 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:28:02,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:28:02,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:28:02,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:28:02,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:28:02,526 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:28:02,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:28:02,593 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18716c0f/c89864a0515444ada13bdbb14d1a78f5/FLAG89ecfe4c1 [2018-11-14 17:28:03,116 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:28:03,117 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:28:03,140 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18716c0f/c89864a0515444ada13bdbb14d1a78f5/FLAG89ecfe4c1 [2018-11-14 17:28:03,161 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a18716c0f/c89864a0515444ada13bdbb14d1a78f5 [2018-11-14 17:28:03,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:28:03,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:28:03,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:28:03,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:28:03,178 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:28:03,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3a8ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03, skipping insertion in model container [2018-11-14 17:28:03,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:28:03,247 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:28:03,642 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:28:03,654 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:28:03,710 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:28:03,859 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:28:03,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03 WrapperNode [2018-11-14 17:28:03,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:28:03,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:28:03,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:28:03,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:28:03,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (1/1) ... [2018-11-14 17:28:03,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:28:03,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:28:03,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:28:03,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:28:03,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (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 [2018-11-14 17:28:04,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:28:04,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:28:04,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:28:04,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:28:04,020 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:28:04,021 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 17:28:04,021 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-14 17:28:04,021 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-14 17:28:04,021 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-14 17:28:04,021 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-14 17:28:04,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:28:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:28:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:28:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:28:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:28:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:28:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:28:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:28:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:28:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:28:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:28:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:28:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:28:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:28:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:28:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:28:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:28:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:28:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:28:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:28:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:28:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:28:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:28:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:28:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:28:04,029 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:28:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:28:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:28:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:28:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:28:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:28:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:28:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:28:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:28:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:28:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:28:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:28:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:28:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:28:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:28:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:28:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:28:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:28:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:28:04,032 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:28:04,033 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:28:04,034 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:28:04,034 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:28:04,034 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:28:04,034 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:28:04,034 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:28:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:28:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:28:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:28:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:28:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:28:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:28:04,035 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:28:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:28:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:28:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:28:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:28:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:28:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:28:04,036 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:28:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:28:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:28:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:28:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:28:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:28:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:28:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:28:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:28:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:28:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:28:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:28:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:28:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:28:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:28:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:28:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:28:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:28:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:28:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:28:04,042 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:28:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:28:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:28:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:28:04,045 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:28:04,046 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:28:04,047 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:28:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:28:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:28:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:28:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:28:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:28:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 17:28:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:28:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:28:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:28:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-14 17:28:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-14 17:28:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:28:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:28:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-14 17:28:04,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:28:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-14 17:28:04,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:28:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:28:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:28:04,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:28:05,157 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:28:05,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:28:05 BoogieIcfgContainer [2018-11-14 17:28:05,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:28:05,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:28:05,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:28:05,162 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:28:05,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:28:03" (1/3) ... [2018-11-14 17:28:05,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10458724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:28:05, skipping insertion in model container [2018-11-14 17:28:05,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:28:03" (2/3) ... [2018-11-14 17:28:05,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10458724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:28:05, skipping insertion in model container [2018-11-14 17:28:05,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:28:05" (3/3) ... [2018-11-14 17:28:05,166 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:28:05,177 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:28:05,186 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:28:05,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:28:05,239 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:28:05,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:28:05,240 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:28:05,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:28:05,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:28:05,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:28:05,241 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:28:05,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:28:05,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:28:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-11-14 17:28:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:28:05,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:05,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:05,276 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:05,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:05,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1727863076, now seen corresponding path program 1 times [2018-11-14 17:28:05,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:05,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:05,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:05,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:05,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {64#true} call ULTIMATE.init(); {64#true} is VALID [2018-11-14 17:28:05,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {64#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {64#true} is VALID [2018-11-14 17:28:05,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {64#true} assume true; {64#true} is VALID [2018-11-14 17:28:05,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {64#true} {64#true} #147#return; {64#true} is VALID [2018-11-14 17:28:05,495 INFO L256 TraceCheckUtils]: 4: Hoare triple {64#true} call #t~ret15 := main(); {64#true} is VALID [2018-11-14 17:28:05,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {64#true} ~len~0 := 2;~data~0 := 1; {64#true} is VALID [2018-11-14 17:28:05,496 INFO L256 TraceCheckUtils]: 6: Hoare triple {64#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {64#true} is VALID [2018-11-14 17:28:05,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {64#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {64#true} is VALID [2018-11-14 17:28:05,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {64#true} assume !true; {65#false} is VALID [2018-11-14 17:28:05,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {65#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {65#false} is VALID [2018-11-14 17:28:05,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {65#false} assume true; {65#false} is VALID [2018-11-14 17:28:05,499 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {65#false} {64#true} #139#return; {65#false} is VALID [2018-11-14 17:28:05,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {65#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {65#false} is VALID [2018-11-14 17:28:05,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {65#false} assume !true; {65#false} is VALID [2018-11-14 17:28:05,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {65#false} ~i~0 := 0; {65#false} is VALID [2018-11-14 17:28:05,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {65#false} assume true; {65#false} is VALID [2018-11-14 17:28:05,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {65#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {65#false} is VALID [2018-11-14 17:28:05,503 INFO L256 TraceCheckUtils]: 17: Hoare triple {65#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {64#true} is VALID [2018-11-14 17:28:05,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {64#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {64#true} is VALID [2018-11-14 17:28:05,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {64#true} assume !true; {64#true} is VALID [2018-11-14 17:28:05,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {64#true} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {64#true} is VALID [2018-11-14 17:28:05,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {64#true} assume true; {64#true} is VALID [2018-11-14 17:28:05,505 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {64#true} {65#false} #143#return; {65#false} is VALID [2018-11-14 17:28:05,505 INFO L273 TraceCheckUtils]: 23: Hoare triple {65#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {65#false} is VALID [2018-11-14 17:28:05,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {65#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {65#false} is VALID [2018-11-14 17:28:05,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {65#false} assume !false; {65#false} is VALID [2018-11-14 17:28:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:05,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:28:05,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:28:05,528 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-14 17:28:05,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:05,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:28:05,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:05,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:28:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:28:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:28:05,746 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 2 states. [2018-11-14 17:28:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:06,184 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2018-11-14 17:28:06,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:28:06,185 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-14 17:28:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:28:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2018-11-14 17:28:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:28:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2018-11-14 17:28:06,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 126 transitions. [2018-11-14 17:28:06,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:06,869 INFO L225 Difference]: With dead ends: 101 [2018-11-14 17:28:06,869 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 17:28:06,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:28:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 17:28:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-14 17:28:06,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:06,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-14 17:28:06,926 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 17:28:06,927 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 17:28:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:06,932 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 17:28:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:28:06,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:06,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:06,934 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-14 17:28:06,934 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-14 17:28:06,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:06,940 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 17:28:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:28:06,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:06,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:06,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:06,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:28:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 17:28:06,947 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 26 [2018-11-14 17:28:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:06,948 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 17:28:06,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:28:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:28:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:28:06,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:06,950 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:06,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:06,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:06,951 INFO L82 PathProgramCache]: Analyzing trace with hash 746528815, now seen corresponding path program 1 times [2018-11-14 17:28:06,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:06,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:06,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:06,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:07,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {363#true} is VALID [2018-11-14 17:28:07,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {363#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {363#true} is VALID [2018-11-14 17:28:07,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2018-11-14 17:28:07,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #147#return; {363#true} is VALID [2018-11-14 17:28:07,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret15 := main(); {363#true} is VALID [2018-11-14 17:28:07,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {363#true} ~len~0 := 2;~data~0 := 1; {365#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:07,102 INFO L256 TraceCheckUtils]: 6: Hoare triple {365#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {363#true} is VALID [2018-11-14 17:28:07,103 INFO L273 TraceCheckUtils]: 7: Hoare triple {363#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {366#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:07,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {366#(<= |sll_create_#in~len| sll_create_~len)} assume true; {366#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:07,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {366#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {367#(<= |sll_create_#in~len| 0)} is VALID [2018-11-14 17:28:07,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {367#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {367#(<= |sll_create_#in~len| 0)} is VALID [2018-11-14 17:28:07,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#(<= |sll_create_#in~len| 0)} assume true; {367#(<= |sll_create_#in~len| 0)} is VALID [2018-11-14 17:28:07,116 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {367#(<= |sll_create_#in~len| 0)} {365#(<= 2 main_~len~0)} #139#return; {364#false} is VALID [2018-11-14 17:28:07,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {364#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {364#false} is VALID [2018-11-14 17:28:07,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {364#false} assume true; {364#false} is VALID [2018-11-14 17:28:07,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {364#false} assume !(~i~0 < ~len~0); {364#false} is VALID [2018-11-14 17:28:07,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {364#false} ~i~0 := 0; {364#false} is VALID [2018-11-14 17:28:07,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {364#false} assume true; {364#false} is VALID [2018-11-14 17:28:07,118 INFO L273 TraceCheckUtils]: 18: Hoare triple {364#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {364#false} is VALID [2018-11-14 17:28:07,119 INFO L256 TraceCheckUtils]: 19: Hoare triple {364#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {363#true} is VALID [2018-11-14 17:28:07,119 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {363#true} is VALID [2018-11-14 17:28:07,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {363#true} assume true; {363#true} is VALID [2018-11-14 17:28:07,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#true} assume !(~index > 0); {363#true} is VALID [2018-11-14 17:28:07,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#true} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {363#true} is VALID [2018-11-14 17:28:07,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#true} assume true; {363#true} is VALID [2018-11-14 17:28:07,121 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {363#true} {364#false} #143#return; {364#false} is VALID [2018-11-14 17:28:07,121 INFO L273 TraceCheckUtils]: 26: Hoare triple {364#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {364#false} is VALID [2018-11-14 17:28:07,121 INFO L273 TraceCheckUtils]: 27: Hoare triple {364#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {364#false} is VALID [2018-11-14 17:28:07,122 INFO L273 TraceCheckUtils]: 28: Hoare triple {364#false} assume !false; {364#false} is VALID [2018-11-14 17:28:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:07,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:28:07,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:28:07,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-14 17:28:07,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:07,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:28:07,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:07,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:28:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:28:07,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:28:07,253 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-11-14 17:28:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:07,730 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-14 17:28:07,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:28:07,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-14 17:28:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:28:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2018-11-14 17:28:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:28:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2018-11-14 17:28:07,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2018-11-14 17:28:07,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:07,893 INFO L225 Difference]: With dead ends: 81 [2018-11-14 17:28:07,893 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 17:28:07,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:28:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 17:28:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-14 17:28:07,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:07,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-14 17:28:07,954 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-14 17:28:07,954 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-14 17:28:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:07,959 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-14 17:28:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 17:28:07,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:07,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:07,960 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-14 17:28:07,961 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-14 17:28:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:07,965 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-14 17:28:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 17:28:07,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:07,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:07,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:07,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 17:28:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-14 17:28:07,969 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2018-11-14 17:28:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:07,970 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-14 17:28:07,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:28:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:28:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:28:07,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:07,972 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:07,972 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:07,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash -619390194, now seen corresponding path program 1 times [2018-11-14 17:28:07,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:07,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:07,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:07,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:07,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:08,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {654#true} call ULTIMATE.init(); {654#true} is VALID [2018-11-14 17:28:08,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {654#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {654#true} is VALID [2018-11-14 17:28:08,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-14 17:28:08,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {654#true} {654#true} #147#return; {654#true} is VALID [2018-11-14 17:28:08,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {654#true} call #t~ret15 := main(); {654#true} is VALID [2018-11-14 17:28:08,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {654#true} ~len~0 := 2;~data~0 := 1; {656#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:08,142 INFO L256 TraceCheckUtils]: 6: Hoare triple {656#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {654#true} is VALID [2018-11-14 17:28:08,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} assume true; {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,149 INFO L256 TraceCheckUtils]: 10: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {654#true} is VALID [2018-11-14 17:28:08,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {654#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {654#true} is VALID [2018-11-14 17:28:08,149 INFO L273 TraceCheckUtils]: 12: Hoare triple {654#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {654#true} is VALID [2018-11-14 17:28:08,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {654#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {654#true} is VALID [2018-11-14 17:28:08,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-14 17:28:08,155 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {654#true} {657#(<= |sll_create_#in~len| sll_create_~len)} #135#return; {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {658#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:08,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {658#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume true; {658#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:08,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {658#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {659#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:08,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {659#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {659#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:08,162 INFO L273 TraceCheckUtils]: 21: Hoare triple {659#(<= |sll_create_#in~len| 1)} assume true; {659#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:08,164 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {659#(<= |sll_create_#in~len| 1)} {656#(<= 2 main_~len~0)} #139#return; {655#false} is VALID [2018-11-14 17:28:08,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {655#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {655#false} is VALID [2018-11-14 17:28:08,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {655#false} assume true; {655#false} is VALID [2018-11-14 17:28:08,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {655#false} assume !(~i~0 < ~len~0); {655#false} is VALID [2018-11-14 17:28:08,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {655#false} ~i~0 := 0; {655#false} is VALID [2018-11-14 17:28:08,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {655#false} assume true; {655#false} is VALID [2018-11-14 17:28:08,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {655#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {655#false} is VALID [2018-11-14 17:28:08,165 INFO L256 TraceCheckUtils]: 29: Hoare triple {655#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {654#true} is VALID [2018-11-14 17:28:08,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {654#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {654#true} is VALID [2018-11-14 17:28:08,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-14 17:28:08,166 INFO L273 TraceCheckUtils]: 32: Hoare triple {654#true} assume !(~index > 0); {654#true} is VALID [2018-11-14 17:28:08,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {654#true} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {654#true} is VALID [2018-11-14 17:28:08,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-14 17:28:08,167 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {654#true} {655#false} #143#return; {655#false} is VALID [2018-11-14 17:28:08,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {655#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {655#false} is VALID [2018-11-14 17:28:08,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {655#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {655#false} is VALID [2018-11-14 17:28:08,168 INFO L273 TraceCheckUtils]: 38: Hoare triple {655#false} assume !false; {655#false} is VALID [2018-11-14 17:28:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:08,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:08,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:28:08,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:08,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:08,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {654#true} call ULTIMATE.init(); {654#true} is VALID [2018-11-14 17:28:08,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {654#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {654#true} is VALID [2018-11-14 17:28:08,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-14 17:28:08,585 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {654#true} {654#true} #147#return; {654#true} is VALID [2018-11-14 17:28:08,585 INFO L256 TraceCheckUtils]: 4: Hoare triple {654#true} call #t~ret15 := main(); {654#true} is VALID [2018-11-14 17:28:08,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {654#true} ~len~0 := 2;~data~0 := 1; {656#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:08,587 INFO L256 TraceCheckUtils]: 6: Hoare triple {656#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {654#true} is VALID [2018-11-14 17:28:08,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} assume true; {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,597 INFO L256 TraceCheckUtils]: 10: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {654#true} is VALID [2018-11-14 17:28:08,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {654#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {654#true} is VALID [2018-11-14 17:28:08,598 INFO L273 TraceCheckUtils]: 12: Hoare triple {654#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {654#true} is VALID [2018-11-14 17:28:08,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {654#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {654#true} is VALID [2018-11-14 17:28:08,599 INFO L273 TraceCheckUtils]: 14: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-14 17:28:08,604 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {654#true} {657#(<= |sll_create_#in~len| sll_create_~len)} #135#return; {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {657#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 17:28:08,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {657#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {658#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:08,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {658#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume true; {658#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-14 17:28:08,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {658#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {659#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:08,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {659#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {659#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:08,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {659#(<= |sll_create_#in~len| 1)} assume true; {659#(<= |sll_create_#in~len| 1)} is VALID [2018-11-14 17:28:08,616 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {659#(<= |sll_create_#in~len| 1)} {656#(<= 2 main_~len~0)} #139#return; {655#false} is VALID [2018-11-14 17:28:08,616 INFO L273 TraceCheckUtils]: 23: Hoare triple {655#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {655#false} is VALID [2018-11-14 17:28:08,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {655#false} assume true; {655#false} is VALID [2018-11-14 17:28:08,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {655#false} assume !(~i~0 < ~len~0); {655#false} is VALID [2018-11-14 17:28:08,618 INFO L273 TraceCheckUtils]: 26: Hoare triple {655#false} ~i~0 := 0; {655#false} is VALID [2018-11-14 17:28:08,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {655#false} assume true; {655#false} is VALID [2018-11-14 17:28:08,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {655#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {655#false} is VALID [2018-11-14 17:28:08,619 INFO L256 TraceCheckUtils]: 29: Hoare triple {655#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {655#false} is VALID [2018-11-14 17:28:08,619 INFO L273 TraceCheckUtils]: 30: Hoare triple {655#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {655#false} is VALID [2018-11-14 17:28:08,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {655#false} assume true; {655#false} is VALID [2018-11-14 17:28:08,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {655#false} assume !(~index > 0); {655#false} is VALID [2018-11-14 17:28:08,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {655#false} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {655#false} is VALID [2018-11-14 17:28:08,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {655#false} assume true; {655#false} is VALID [2018-11-14 17:28:08,621 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {655#false} {655#false} #143#return; {655#false} is VALID [2018-11-14 17:28:08,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {655#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {655#false} is VALID [2018-11-14 17:28:08,621 INFO L273 TraceCheckUtils]: 37: Hoare triple {655#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {655#false} is VALID [2018-11-14 17:28:08,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {655#false} assume !false; {655#false} is VALID [2018-11-14 17:28:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:28:08,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:28:08,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 17:28:08,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-14 17:28:08,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:08,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:28:08,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:08,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:28:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:28:08,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:28:08,799 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-11-14 17:28:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:09,340 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-11-14 17:28:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:28:09,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-14 17:28:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:28:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2018-11-14 17:28:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:28:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2018-11-14 17:28:09,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2018-11-14 17:28:09,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:09,598 INFO L225 Difference]: With dead ends: 86 [2018-11-14 17:28:09,598 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 17:28:09,599 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:28:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 17:28:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-11-14 17:28:09,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:09,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 54 states. [2018-11-14 17:28:09,655 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 54 states. [2018-11-14 17:28:09,656 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 54 states. [2018-11-14 17:28:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:09,660 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-14 17:28:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-14 17:28:09,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:09,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:09,662 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 57 states. [2018-11-14 17:28:09,662 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 57 states. [2018-11-14 17:28:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:09,673 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-14 17:28:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-11-14 17:28:09,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:09,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:09,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:09,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:28:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-11-14 17:28:09,683 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-11-14 17:28:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:09,683 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-14 17:28:09,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:28:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-14 17:28:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:28:09,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:09,685 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:09,686 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:09,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:09,686 INFO L82 PathProgramCache]: Analyzing trace with hash -259929299, now seen corresponding path program 2 times [2018-11-14 17:28:09,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:09,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:09,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:09,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {1084#true} call ULTIMATE.init(); {1084#true} is VALID [2018-11-14 17:28:09,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {1084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1084#true} is VALID [2018-11-14 17:28:09,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,900 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1084#true} {1084#true} #147#return; {1084#true} is VALID [2018-11-14 17:28:09,900 INFO L256 TraceCheckUtils]: 4: Hoare triple {1084#true} call #t~ret15 := main(); {1084#true} is VALID [2018-11-14 17:28:09,901 INFO L273 TraceCheckUtils]: 5: Hoare triple {1084#true} ~len~0 := 2;~data~0 := 1; {1086#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:09,901 INFO L256 TraceCheckUtils]: 6: Hoare triple {1086#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1084#true} is VALID [2018-11-14 17:28:09,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {1084#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1084#true} is VALID [2018-11-14 17:28:09,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {1084#true} assume !!(~len > 0); {1084#true} is VALID [2018-11-14 17:28:09,902 INFO L256 TraceCheckUtils]: 10: Hoare triple {1084#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1084#true} is VALID [2018-11-14 17:28:09,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {1084#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1084#true} is VALID [2018-11-14 17:28:09,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {1084#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1084#true} is VALID [2018-11-14 17:28:09,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {1084#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1084#true} is VALID [2018-11-14 17:28:09,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,903 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1084#true} {1084#true} #135#return; {1084#true} is VALID [2018-11-14 17:28:09,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {1084#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1084#true} is VALID [2018-11-14 17:28:09,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {1084#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1084#true} is VALID [2018-11-14 17:28:09,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {1084#true} assume !!(~len > 0); {1084#true} is VALID [2018-11-14 17:28:09,904 INFO L256 TraceCheckUtils]: 20: Hoare triple {1084#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1084#true} is VALID [2018-11-14 17:28:09,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {1084#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1084#true} is VALID [2018-11-14 17:28:09,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {1084#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1084#true} is VALID [2018-11-14 17:28:09,905 INFO L273 TraceCheckUtils]: 23: Hoare triple {1084#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1084#true} is VALID [2018-11-14 17:28:09,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,905 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1084#true} {1084#true} #135#return; {1084#true} is VALID [2018-11-14 17:28:09,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {1084#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1084#true} is VALID [2018-11-14 17:28:09,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {1084#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1084#true} is VALID [2018-11-14 17:28:09,906 INFO L273 TraceCheckUtils]: 28: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {1084#true} assume !(~len > 0); {1084#true} is VALID [2018-11-14 17:28:09,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {1084#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1084#true} is VALID [2018-11-14 17:28:09,908 INFO L273 TraceCheckUtils]: 31: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,928 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1084#true} {1086#(<= 2 main_~len~0)} #139#return; {1086#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:09,943 INFO L273 TraceCheckUtils]: 33: Hoare triple {1086#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1087#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:28:09,958 INFO L273 TraceCheckUtils]: 34: Hoare triple {1087#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume true; {1087#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:28:09,959 INFO L273 TraceCheckUtils]: 35: Hoare triple {1087#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !(~i~0 < ~len~0); {1085#false} is VALID [2018-11-14 17:28:09,959 INFO L273 TraceCheckUtils]: 36: Hoare triple {1085#false} ~i~0 := 0; {1085#false} is VALID [2018-11-14 17:28:09,959 INFO L273 TraceCheckUtils]: 37: Hoare triple {1085#false} assume true; {1085#false} is VALID [2018-11-14 17:28:09,959 INFO L273 TraceCheckUtils]: 38: Hoare triple {1085#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1085#false} is VALID [2018-11-14 17:28:09,959 INFO L256 TraceCheckUtils]: 39: Hoare triple {1085#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1084#true} is VALID [2018-11-14 17:28:09,960 INFO L273 TraceCheckUtils]: 40: Hoare triple {1084#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1084#true} is VALID [2018-11-14 17:28:09,960 INFO L273 TraceCheckUtils]: 41: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,960 INFO L273 TraceCheckUtils]: 42: Hoare triple {1084#true} assume !(~index > 0); {1084#true} is VALID [2018-11-14 17:28:09,960 INFO L273 TraceCheckUtils]: 43: Hoare triple {1084#true} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {1084#true} is VALID [2018-11-14 17:28:09,961 INFO L273 TraceCheckUtils]: 44: Hoare triple {1084#true} assume true; {1084#true} is VALID [2018-11-14 17:28:09,961 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1084#true} {1085#false} #143#return; {1085#false} is VALID [2018-11-14 17:28:09,961 INFO L273 TraceCheckUtils]: 46: Hoare triple {1085#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1085#false} is VALID [2018-11-14 17:28:09,961 INFO L273 TraceCheckUtils]: 47: Hoare triple {1085#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1085#false} is VALID [2018-11-14 17:28:09,961 INFO L273 TraceCheckUtils]: 48: Hoare triple {1085#false} assume !false; {1085#false} is VALID [2018-11-14 17:28:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 17:28:09,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:28:09,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:28:09,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-14 17:28:09,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:09,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:28:10,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:10,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:28:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:28:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:28:10,044 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 4 states. [2018-11-14 17:28:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:10,269 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-14 17:28:10,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:28:10,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-14 17:28:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:28:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2018-11-14 17:28:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:28:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2018-11-14 17:28:10,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2018-11-14 17:28:10,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:10,422 INFO L225 Difference]: With dead ends: 81 [2018-11-14 17:28:10,422 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:28:10,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:28:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:28:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-11-14 17:28:10,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:10,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 56 states. [2018-11-14 17:28:10,474 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 56 states. [2018-11-14 17:28:10,474 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 56 states. [2018-11-14 17:28:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:10,479 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-14 17:28:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-14 17:28:10,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:10,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:10,481 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 66 states. [2018-11-14 17:28:10,481 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 66 states. [2018-11-14 17:28:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:10,485 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-14 17:28:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-14 17:28:10,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:10,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:10,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:10,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:28:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-14 17:28:10,489 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 49 [2018-11-14 17:28:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:10,490 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-14 17:28:10,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:28:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-14 17:28:10,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 17:28:10,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:10,492 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:10,492 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:10,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash 933134682, now seen corresponding path program 1 times [2018-11-14 17:28:10,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:10,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:10,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:28:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:10,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {1412#true} call ULTIMATE.init(); {1412#true} is VALID [2018-11-14 17:28:10,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {1412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1412#true} is VALID [2018-11-14 17:28:10,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1412#true} {1412#true} #147#return; {1412#true} is VALID [2018-11-14 17:28:10,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {1412#true} call #t~ret15 := main(); {1412#true} is VALID [2018-11-14 17:28:10,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {1412#true} ~len~0 := 2;~data~0 := 1; {1414#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:10,695 INFO L256 TraceCheckUtils]: 6: Hoare triple {1414#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1412#true} is VALID [2018-11-14 17:28:10,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {1412#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1412#true} is VALID [2018-11-14 17:28:10,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {1412#true} assume !!(~len > 0); {1412#true} is VALID [2018-11-14 17:28:10,697 INFO L256 TraceCheckUtils]: 10: Hoare triple {1412#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1412#true} is VALID [2018-11-14 17:28:10,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {1412#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1412#true} is VALID [2018-11-14 17:28:10,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {1412#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1412#true} is VALID [2018-11-14 17:28:10,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {1412#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1412#true} is VALID [2018-11-14 17:28:10,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,702 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1412#true} {1412#true} #135#return; {1412#true} is VALID [2018-11-14 17:28:10,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {1412#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1412#true} is VALID [2018-11-14 17:28:10,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {1412#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1412#true} is VALID [2018-11-14 17:28:10,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {1412#true} assume !!(~len > 0); {1412#true} is VALID [2018-11-14 17:28:10,704 INFO L256 TraceCheckUtils]: 20: Hoare triple {1412#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1412#true} is VALID [2018-11-14 17:28:10,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {1412#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1412#true} is VALID [2018-11-14 17:28:10,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {1412#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1412#true} is VALID [2018-11-14 17:28:10,704 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1412#true} is VALID [2018-11-14 17:28:10,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,706 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1412#true} {1412#true} #135#return; {1412#true} is VALID [2018-11-14 17:28:10,706 INFO L273 TraceCheckUtils]: 26: Hoare triple {1412#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1412#true} is VALID [2018-11-14 17:28:10,706 INFO L273 TraceCheckUtils]: 27: Hoare triple {1412#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1412#true} is VALID [2018-11-14 17:28:10,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {1412#true} assume !(~len > 0); {1412#true} is VALID [2018-11-14 17:28:10,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {1412#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1412#true} is VALID [2018-11-14 17:28:10,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,720 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1412#true} {1414#(<= 2 main_~len~0)} #139#return; {1414#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:10,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {1414#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:28:10,726 INFO L273 TraceCheckUtils]: 34: Hoare triple {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume true; {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:28:10,727 INFO L273 TraceCheckUtils]: 35: Hoare triple {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:28:10,727 INFO L256 TraceCheckUtils]: 36: Hoare triple {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1412#true} is VALID [2018-11-14 17:28:10,727 INFO L273 TraceCheckUtils]: 37: Hoare triple {1412#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1412#true} is VALID [2018-11-14 17:28:10,727 INFO L273 TraceCheckUtils]: 38: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,728 INFO L273 TraceCheckUtils]: 39: Hoare triple {1412#true} assume !(~index > 0); {1412#true} is VALID [2018-11-14 17:28:10,728 INFO L273 TraceCheckUtils]: 40: Hoare triple {1412#true} call write~int(~data, ~head.base, ~head.offset + 0, 4); {1412#true} is VALID [2018-11-14 17:28:10,728 INFO L273 TraceCheckUtils]: 41: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,736 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1412#true} {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} #141#return; {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} is VALID [2018-11-14 17:28:10,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {1415#(and (<= 2 main_~len~0) (= main_~i~0 0))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1416#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-14 17:28:10,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {1416#(<= (+ main_~i~0 1) main_~len~0)} assume true; {1416#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-14 17:28:10,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {1416#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {1413#false} is VALID [2018-11-14 17:28:10,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {1413#false} ~i~0 := 0; {1413#false} is VALID [2018-11-14 17:28:10,739 INFO L273 TraceCheckUtils]: 47: Hoare triple {1413#false} assume true; {1413#false} is VALID [2018-11-14 17:28:10,739 INFO L273 TraceCheckUtils]: 48: Hoare triple {1413#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1413#false} is VALID [2018-11-14 17:28:10,739 INFO L256 TraceCheckUtils]: 49: Hoare triple {1413#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1412#true} is VALID [2018-11-14 17:28:10,740 INFO L273 TraceCheckUtils]: 50: Hoare triple {1412#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1412#true} is VALID [2018-11-14 17:28:10,740 INFO L273 TraceCheckUtils]: 51: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,740 INFO L273 TraceCheckUtils]: 52: Hoare triple {1412#true} assume !(~index > 0); {1412#true} is VALID [2018-11-14 17:28:10,740 INFO L273 TraceCheckUtils]: 53: Hoare triple {1412#true} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {1412#true} is VALID [2018-11-14 17:28:10,741 INFO L273 TraceCheckUtils]: 54: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:10,741 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1412#true} {1413#false} #143#return; {1413#false} is VALID [2018-11-14 17:28:10,741 INFO L273 TraceCheckUtils]: 56: Hoare triple {1413#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1413#false} is VALID [2018-11-14 17:28:10,741 INFO L273 TraceCheckUtils]: 57: Hoare triple {1413#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1413#false} is VALID [2018-11-14 17:28:10,742 INFO L273 TraceCheckUtils]: 58: Hoare triple {1413#false} assume !false; {1413#false} is VALID [2018-11-14 17:28:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 17:28:10,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:10,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:28:10,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:10,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:11,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {1412#true} call ULTIMATE.init(); {1412#true} is VALID [2018-11-14 17:28:11,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {1412#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1412#true} is VALID [2018-11-14 17:28:11,101 INFO L273 TraceCheckUtils]: 2: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,101 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1412#true} {1412#true} #147#return; {1412#true} is VALID [2018-11-14 17:28:11,101 INFO L256 TraceCheckUtils]: 4: Hoare triple {1412#true} call #t~ret15 := main(); {1412#true} is VALID [2018-11-14 17:28:11,102 INFO L273 TraceCheckUtils]: 5: Hoare triple {1412#true} ~len~0 := 2;~data~0 := 1; {1414#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:11,102 INFO L256 TraceCheckUtils]: 6: Hoare triple {1414#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1412#true} is VALID [2018-11-14 17:28:11,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {1412#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1412#true} is VALID [2018-11-14 17:28:11,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {1412#true} assume !!(~len > 0); {1412#true} is VALID [2018-11-14 17:28:11,102 INFO L256 TraceCheckUtils]: 10: Hoare triple {1412#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1412#true} is VALID [2018-11-14 17:28:11,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {1412#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1412#true} is VALID [2018-11-14 17:28:11,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {1412#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1412#true} is VALID [2018-11-14 17:28:11,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {1412#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1412#true} is VALID [2018-11-14 17:28:11,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,104 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1412#true} {1412#true} #135#return; {1412#true} is VALID [2018-11-14 17:28:11,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {1412#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1412#true} is VALID [2018-11-14 17:28:11,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {1412#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1412#true} is VALID [2018-11-14 17:28:11,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {1412#true} assume !!(~len > 0); {1412#true} is VALID [2018-11-14 17:28:11,106 INFO L256 TraceCheckUtils]: 20: Hoare triple {1412#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1412#true} is VALID [2018-11-14 17:28:11,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {1412#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1412#true} is VALID [2018-11-14 17:28:11,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {1412#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1412#true} is VALID [2018-11-14 17:28:11,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1412#true} is VALID [2018-11-14 17:28:11,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,107 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1412#true} {1412#true} #135#return; {1412#true} is VALID [2018-11-14 17:28:11,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {1412#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1412#true} is VALID [2018-11-14 17:28:11,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {1412#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1412#true} is VALID [2018-11-14 17:28:11,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {1412#true} assume !(~len > 0); {1412#true} is VALID [2018-11-14 17:28:11,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {1412#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1412#true} is VALID [2018-11-14 17:28:11,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,109 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1412#true} {1414#(<= 2 main_~len~0)} #139#return; {1414#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:11,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {1414#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-14 17:28:11,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume true; {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-14 17:28:11,111 INFO L273 TraceCheckUtils]: 35: Hoare triple {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-14 17:28:11,111 INFO L256 TraceCheckUtils]: 36: Hoare triple {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1412#true} is VALID [2018-11-14 17:28:11,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {1412#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1412#true} is VALID [2018-11-14 17:28:11,111 INFO L273 TraceCheckUtils]: 38: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,112 INFO L273 TraceCheckUtils]: 39: Hoare triple {1412#true} assume !(~index > 0); {1412#true} is VALID [2018-11-14 17:28:11,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {1412#true} call write~int(~data, ~head.base, ~head.offset + 0, 4); {1412#true} is VALID [2018-11-14 17:28:11,112 INFO L273 TraceCheckUtils]: 41: Hoare triple {1412#true} assume true; {1412#true} is VALID [2018-11-14 17:28:11,113 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1412#true} {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #141#return; {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} is VALID [2018-11-14 17:28:11,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {1519#(and (<= main_~i~0 0) (<= 2 main_~len~0))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1550#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-14 17:28:11,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {1550#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume true; {1550#(and (<= main_~i~0 1) (<= 2 main_~len~0))} is VALID [2018-11-14 17:28:11,115 INFO L273 TraceCheckUtils]: 45: Hoare triple {1550#(and (<= main_~i~0 1) (<= 2 main_~len~0))} assume !(~i~0 < ~len~0); {1413#false} is VALID [2018-11-14 17:28:11,115 INFO L273 TraceCheckUtils]: 46: Hoare triple {1413#false} ~i~0 := 0; {1413#false} is VALID [2018-11-14 17:28:11,116 INFO L273 TraceCheckUtils]: 47: Hoare triple {1413#false} assume true; {1413#false} is VALID [2018-11-14 17:28:11,116 INFO L273 TraceCheckUtils]: 48: Hoare triple {1413#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1413#false} is VALID [2018-11-14 17:28:11,116 INFO L256 TraceCheckUtils]: 49: Hoare triple {1413#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1413#false} is VALID [2018-11-14 17:28:11,116 INFO L273 TraceCheckUtils]: 50: Hoare triple {1413#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1413#false} is VALID [2018-11-14 17:28:11,116 INFO L273 TraceCheckUtils]: 51: Hoare triple {1413#false} assume true; {1413#false} is VALID [2018-11-14 17:28:11,117 INFO L273 TraceCheckUtils]: 52: Hoare triple {1413#false} assume !(~index > 0); {1413#false} is VALID [2018-11-14 17:28:11,117 INFO L273 TraceCheckUtils]: 53: Hoare triple {1413#false} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {1413#false} is VALID [2018-11-14 17:28:11,117 INFO L273 TraceCheckUtils]: 54: Hoare triple {1413#false} assume true; {1413#false} is VALID [2018-11-14 17:28:11,117 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1413#false} {1413#false} #143#return; {1413#false} is VALID [2018-11-14 17:28:11,118 INFO L273 TraceCheckUtils]: 56: Hoare triple {1413#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1413#false} is VALID [2018-11-14 17:28:11,118 INFO L273 TraceCheckUtils]: 57: Hoare triple {1413#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1413#false} is VALID [2018-11-14 17:28:11,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {1413#false} assume !false; {1413#false} is VALID [2018-11-14 17:28:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 17:28:11,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:28:11,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-14 17:28:11,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-11-14 17:28:11,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:11,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:28:11,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:11,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:28:11,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:28:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:28:11,212 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 7 states. [2018-11-14 17:28:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:11,686 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-11-14 17:28:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:28:11,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-11-14 17:28:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:28:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2018-11-14 17:28:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:28:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2018-11-14 17:28:11,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 96 transitions. [2018-11-14 17:28:11,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:11,870 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:28:11,870 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:28:11,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:28:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:28:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2018-11-14 17:28:11,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:11,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 60 states. [2018-11-14 17:28:11,959 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 60 states. [2018-11-14 17:28:11,959 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 60 states. [2018-11-14 17:28:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:11,964 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-14 17:28:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-14 17:28:11,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:11,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:11,965 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 78 states. [2018-11-14 17:28:11,965 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 78 states. [2018-11-14 17:28:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:11,969 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-11-14 17:28:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-14 17:28:11,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:11,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:11,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:11,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 17:28:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-14 17:28:11,974 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 59 [2018-11-14 17:28:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:11,974 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-14 17:28:11,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:28:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-14 17:28:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 17:28:11,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:11,976 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:11,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:11,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:11,977 INFO L82 PathProgramCache]: Analyzing trace with hash 251863879, now seen corresponding path program 2 times [2018-11-14 17:28:11,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:11,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:11,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:11,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:28:11,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:12,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {1966#true} call ULTIMATE.init(); {1966#true} is VALID [2018-11-14 17:28:12,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {1966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1966#true} is VALID [2018-11-14 17:28:12,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1966#true} #147#return; {1966#true} is VALID [2018-11-14 17:28:12,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {1966#true} call #t~ret15 := main(); {1966#true} is VALID [2018-11-14 17:28:12,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {1966#true} ~len~0 := 2;~data~0 := 1; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,152 INFO L256 TraceCheckUtils]: 6: Hoare triple {1968#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1966#true} is VALID [2018-11-14 17:28:12,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {1966#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1966#true} is VALID [2018-11-14 17:28:12,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {1966#true} assume !!(~len > 0); {1966#true} is VALID [2018-11-14 17:28:12,153 INFO L256 TraceCheckUtils]: 10: Hoare triple {1966#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1966#true} is VALID [2018-11-14 17:28:12,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {1966#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1966#true} is VALID [2018-11-14 17:28:12,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {1966#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1966#true} is VALID [2018-11-14 17:28:12,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {1966#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,154 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1966#true} {1966#true} #135#return; {1966#true} is VALID [2018-11-14 17:28:12,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {1966#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {1966#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1966#true} is VALID [2018-11-14 17:28:12,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {1966#true} assume !!(~len > 0); {1966#true} is VALID [2018-11-14 17:28:12,155 INFO L256 TraceCheckUtils]: 20: Hoare triple {1966#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1966#true} is VALID [2018-11-14 17:28:12,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {1966#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1966#true} is VALID [2018-11-14 17:28:12,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {1966#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1966#true} is VALID [2018-11-14 17:28:12,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {1966#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,157 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1966#true} {1966#true} #135#return; {1966#true} is VALID [2018-11-14 17:28:12,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {1966#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,157 INFO L273 TraceCheckUtils]: 27: Hoare triple {1966#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1966#true} is VALID [2018-11-14 17:28:12,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {1966#true} assume !(~len > 0); {1966#true} is VALID [2018-11-14 17:28:12,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {1966#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,161 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1966#true} {1968#(<= 2 main_~len~0)} #139#return; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,162 INFO L273 TraceCheckUtils]: 33: Hoare triple {1968#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {1968#(<= 2 main_~len~0)} assume true; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {1968#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,165 INFO L256 TraceCheckUtils]: 36: Hoare triple {1968#(<= 2 main_~len~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1966#true} is VALID [2018-11-14 17:28:12,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {1966#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1966#true} is VALID [2018-11-14 17:28:12,165 INFO L273 TraceCheckUtils]: 38: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,165 INFO L273 TraceCheckUtils]: 39: Hoare triple {1966#true} assume !(~index > 0); {1966#true} is VALID [2018-11-14 17:28:12,165 INFO L273 TraceCheckUtils]: 40: Hoare triple {1966#true} call write~int(~data, ~head.base, ~head.offset + 0, 4); {1966#true} is VALID [2018-11-14 17:28:12,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,167 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1966#true} {1968#(<= 2 main_~len~0)} #141#return; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,171 INFO L273 TraceCheckUtils]: 43: Hoare triple {1968#(<= 2 main_~len~0)} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {1968#(<= 2 main_~len~0)} assume true; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,174 INFO L273 TraceCheckUtils]: 45: Hoare triple {1968#(<= 2 main_~len~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {1968#(<= 2 main_~len~0)} is VALID [2018-11-14 17:28:12,174 INFO L256 TraceCheckUtils]: 46: Hoare triple {1968#(<= 2 main_~len~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1966#true} is VALID [2018-11-14 17:28:12,174 INFO L273 TraceCheckUtils]: 47: Hoare triple {1966#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1969#(<= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-14 17:28:12,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {1969#(<= |sll_update_at_#in~index| sll_update_at_~index)} assume true; {1969#(<= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-14 17:28:12,177 INFO L273 TraceCheckUtils]: 49: Hoare triple {1969#(<= |sll_update_at_#in~index| sll_update_at_~index)} assume !(~index > 0); {1970#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-14 17:28:12,180 INFO L273 TraceCheckUtils]: 50: Hoare triple {1970#(<= |sll_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset + 0, 4); {1970#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-14 17:28:12,180 INFO L273 TraceCheckUtils]: 51: Hoare triple {1970#(<= |sll_update_at_#in~index| 0)} assume true; {1970#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-14 17:28:12,182 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1970#(<= |sll_update_at_#in~index| 0)} {1968#(<= 2 main_~len~0)} #141#return; {1971#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2018-11-14 17:28:12,183 INFO L273 TraceCheckUtils]: 53: Hoare triple {1971#(<= (+ main_~i~0 2) main_~len~0)} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1972#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-14 17:28:12,183 INFO L273 TraceCheckUtils]: 54: Hoare triple {1972#(<= (+ main_~i~0 1) main_~len~0)} assume true; {1972#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2018-11-14 17:28:12,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {1972#(<= (+ main_~i~0 1) main_~len~0)} assume !(~i~0 < ~len~0); {1967#false} is VALID [2018-11-14 17:28:12,185 INFO L273 TraceCheckUtils]: 56: Hoare triple {1967#false} ~i~0 := 0; {1967#false} is VALID [2018-11-14 17:28:12,185 INFO L273 TraceCheckUtils]: 57: Hoare triple {1967#false} assume true; {1967#false} is VALID [2018-11-14 17:28:12,186 INFO L273 TraceCheckUtils]: 58: Hoare triple {1967#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1967#false} is VALID [2018-11-14 17:28:12,186 INFO L256 TraceCheckUtils]: 59: Hoare triple {1967#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1966#true} is VALID [2018-11-14 17:28:12,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {1966#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1966#true} is VALID [2018-11-14 17:28:12,187 INFO L273 TraceCheckUtils]: 61: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {1966#true} assume !(~index > 0); {1966#true} is VALID [2018-11-14 17:28:12,187 INFO L273 TraceCheckUtils]: 63: Hoare triple {1966#true} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {1966#true} is VALID [2018-11-14 17:28:12,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,188 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {1966#true} {1967#false} #143#return; {1967#false} is VALID [2018-11-14 17:28:12,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {1967#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1967#false} is VALID [2018-11-14 17:28:12,188 INFO L273 TraceCheckUtils]: 67: Hoare triple {1967#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1967#false} is VALID [2018-11-14 17:28:12,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {1967#false} assume !false; {1967#false} is VALID [2018-11-14 17:28:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:28:12,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:28:12,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:28:12,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:28:12,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:28:12,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:28:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:12,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:28:12,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {1966#true} call ULTIMATE.init(); {1966#true} is VALID [2018-11-14 17:28:12,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {1966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1966#true} is VALID [2018-11-14 17:28:12,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1966#true} {1966#true} #147#return; {1966#true} is VALID [2018-11-14 17:28:12,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {1966#true} call #t~ret15 := main(); {1966#true} is VALID [2018-11-14 17:28:12,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {1966#true} ~len~0 := 2;~data~0 := 1; {1966#true} is VALID [2018-11-14 17:28:12,782 INFO L256 TraceCheckUtils]: 6: Hoare triple {1966#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1966#true} is VALID [2018-11-14 17:28:12,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {1966#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1966#true} is VALID [2018-11-14 17:28:12,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {1966#true} assume !!(~len > 0); {1966#true} is VALID [2018-11-14 17:28:12,783 INFO L256 TraceCheckUtils]: 10: Hoare triple {1966#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1966#true} is VALID [2018-11-14 17:28:12,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {1966#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1966#true} is VALID [2018-11-14 17:28:12,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {1966#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1966#true} is VALID [2018-11-14 17:28:12,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {1966#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,787 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1966#true} {1966#true} #135#return; {1966#true} is VALID [2018-11-14 17:28:12,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {1966#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {1966#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1966#true} is VALID [2018-11-14 17:28:12,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {1966#true} assume !!(~len > 0); {1966#true} is VALID [2018-11-14 17:28:12,788 INFO L256 TraceCheckUtils]: 20: Hoare triple {1966#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1966#true} is VALID [2018-11-14 17:28:12,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {1966#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1966#true} is VALID [2018-11-14 17:28:12,789 INFO L273 TraceCheckUtils]: 22: Hoare triple {1966#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1966#true} is VALID [2018-11-14 17:28:12,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {1966#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 0, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,789 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1966#true} {1966#true} #135#return; {1966#true} is VALID [2018-11-14 17:28:12,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {1966#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 4, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {1966#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1966#true} is VALID [2018-11-14 17:28:12,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {1966#true} assume !(~len > 0); {1966#true} is VALID [2018-11-14 17:28:12,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {1966#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1966#true} is VALID [2018-11-14 17:28:12,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,791 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1966#true} {1966#true} #139#return; {1966#true} is VALID [2018-11-14 17:28:12,791 INFO L273 TraceCheckUtils]: 33: Hoare triple {1966#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0; {2075#(<= 0 main_~i~0)} is VALID [2018-11-14 17:28:12,795 INFO L273 TraceCheckUtils]: 34: Hoare triple {2075#(<= 0 main_~i~0)} assume true; {2075#(<= 0 main_~i~0)} is VALID [2018-11-14 17:28:12,795 INFO L273 TraceCheckUtils]: 35: Hoare triple {2075#(<= 0 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {2075#(<= 0 main_~i~0)} is VALID [2018-11-14 17:28:12,795 INFO L256 TraceCheckUtils]: 36: Hoare triple {2075#(<= 0 main_~i~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1966#true} is VALID [2018-11-14 17:28:12,795 INFO L273 TraceCheckUtils]: 37: Hoare triple {1966#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1966#true} is VALID [2018-11-14 17:28:12,796 INFO L273 TraceCheckUtils]: 38: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,796 INFO L273 TraceCheckUtils]: 39: Hoare triple {1966#true} assume !(~index > 0); {1966#true} is VALID [2018-11-14 17:28:12,796 INFO L273 TraceCheckUtils]: 40: Hoare triple {1966#true} call write~int(~data, ~head.base, ~head.offset + 0, 4); {1966#true} is VALID [2018-11-14 17:28:12,796 INFO L273 TraceCheckUtils]: 41: Hoare triple {1966#true} assume true; {1966#true} is VALID [2018-11-14 17:28:12,797 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1966#true} {2075#(<= 0 main_~i~0)} #141#return; {2075#(<= 0 main_~i~0)} is VALID [2018-11-14 17:28:12,797 INFO L273 TraceCheckUtils]: 43: Hoare triple {2075#(<= 0 main_~i~0)} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2106#(<= 1 main_~i~0)} is VALID [2018-11-14 17:28:12,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {2106#(<= 1 main_~i~0)} assume true; {2106#(<= 1 main_~i~0)} is VALID [2018-11-14 17:28:12,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {2106#(<= 1 main_~i~0)} assume !!(~i~0 < ~len~0);~new_data~0 := ~i~0 + ~len~0; {2106#(<= 1 main_~i~0)} is VALID [2018-11-14 17:28:12,802 INFO L256 TraceCheckUtils]: 46: Hoare triple {2106#(<= 1 main_~i~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1966#true} is VALID [2018-11-14 17:28:12,803 INFO L273 TraceCheckUtils]: 47: Hoare triple {1966#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1969#(<= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-14 17:28:12,803 INFO L273 TraceCheckUtils]: 48: Hoare triple {1969#(<= |sll_update_at_#in~index| sll_update_at_~index)} assume true; {1969#(<= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-14 17:28:12,804 INFO L273 TraceCheckUtils]: 49: Hoare triple {1969#(<= |sll_update_at_#in~index| sll_update_at_~index)} assume !(~index > 0); {1970#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-14 17:28:12,804 INFO L273 TraceCheckUtils]: 50: Hoare triple {1970#(<= |sll_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset + 0, 4); {1970#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-14 17:28:12,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {1970#(<= |sll_update_at_#in~index| 0)} assume true; {1970#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-14 17:28:12,822 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1970#(<= |sll_update_at_#in~index| 0)} {2106#(<= 1 main_~i~0)} #141#return; {1967#false} is VALID [2018-11-14 17:28:12,823 INFO L273 TraceCheckUtils]: 53: Hoare triple {1967#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1967#false} is VALID [2018-11-14 17:28:12,823 INFO L273 TraceCheckUtils]: 54: Hoare triple {1967#false} assume true; {1967#false} is VALID [2018-11-14 17:28:12,823 INFO L273 TraceCheckUtils]: 55: Hoare triple {1967#false} assume !(~i~0 < ~len~0); {1967#false} is VALID [2018-11-14 17:28:12,823 INFO L273 TraceCheckUtils]: 56: Hoare triple {1967#false} ~i~0 := 0; {1967#false} is VALID [2018-11-14 17:28:12,823 INFO L273 TraceCheckUtils]: 57: Hoare triple {1967#false} assume true; {1967#false} is VALID [2018-11-14 17:28:12,823 INFO L273 TraceCheckUtils]: 58: Hoare triple {1967#false} assume !!(~i~0 < ~len~0);~expected~0 := ~i~0 + ~len~0; {1967#false} is VALID [2018-11-14 17:28:12,824 INFO L256 TraceCheckUtils]: 59: Hoare triple {1967#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1967#false} is VALID [2018-11-14 17:28:12,824 INFO L273 TraceCheckUtils]: 60: Hoare triple {1967#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1967#false} is VALID [2018-11-14 17:28:12,824 INFO L273 TraceCheckUtils]: 61: Hoare triple {1967#false} assume true; {1967#false} is VALID [2018-11-14 17:28:12,824 INFO L273 TraceCheckUtils]: 62: Hoare triple {1967#false} assume !(~index > 0); {1967#false} is VALID [2018-11-14 17:28:12,824 INFO L273 TraceCheckUtils]: 63: Hoare triple {1967#false} call #t~mem8 := read~int(~head.base, ~head.offset + 0, 4);#res := #t~mem8;havoc #t~mem8; {1967#false} is VALID [2018-11-14 17:28:12,824 INFO L273 TraceCheckUtils]: 64: Hoare triple {1967#false} assume true; {1967#false} is VALID [2018-11-14 17:28:12,824 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {1967#false} {1967#false} #143#return; {1967#false} is VALID [2018-11-14 17:28:12,825 INFO L273 TraceCheckUtils]: 66: Hoare triple {1967#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1967#false} is VALID [2018-11-14 17:28:12,825 INFO L273 TraceCheckUtils]: 67: Hoare triple {1967#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1967#false} is VALID [2018-11-14 17:28:12,825 INFO L273 TraceCheckUtils]: 68: Hoare triple {1967#false} assume !false; {1967#false} is VALID [2018-11-14 17:28:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 17:28:12,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:28:12,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-14 17:28:12,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-11-14 17:28:12,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:28:12,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:28:12,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:12,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:28:12,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:28:12,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:28:12,938 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 9 states. [2018-11-14 17:28:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:14,152 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-11-14 17:28:14,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:28:14,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-11-14 17:28:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:28:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:28:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-14 17:28:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:28:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-14 17:28:14,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 104 transitions. [2018-11-14 17:28:14,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:28:14,275 INFO L225 Difference]: With dead ends: 100 [2018-11-14 17:28:14,275 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:28:14,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:28:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:28:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-11-14 17:28:14,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:28:14,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 65 states. [2018-11-14 17:28:14,412 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 65 states. [2018-11-14 17:28:14,412 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 65 states. [2018-11-14 17:28:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:14,416 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-14 17:28:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-11-14 17:28:14,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:14,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:14,417 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 75 states. [2018-11-14 17:28:14,417 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 75 states. [2018-11-14 17:28:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:28:14,421 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-11-14 17:28:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-11-14 17:28:14,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:28:14,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:28:14,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:28:14,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:28:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:28:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-14 17:28:14,425 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 69 [2018-11-14 17:28:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:28:14,425 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-14 17:28:14,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:28:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-14 17:28:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-14 17:28:14,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:28:14,426 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:28:14,427 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:28:14,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:28:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash -113780543, now seen corresponding path program 1 times [2018-11-14 17:28:14,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:28:14,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:28:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:14,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:28:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:28:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:28:14,890 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2018-11-14 17:28:14,894 INFO L168 Benchmark]: Toolchain (without parser) took 11722.39 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 878.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -675.6 MB). Peak memory consumption was 203.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:14,896 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:28:14,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:14,897 INFO L168 Benchmark]: Boogie Preprocessor took 82.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:14,898 INFO L168 Benchmark]: RCFGBuilder took 1213.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 77.3 MB). Peak memory consumption was 77.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:14,898 INFO L168 Benchmark]: TraceAbstraction took 9734.15 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 43.1 MB). Peak memory consumption was 171.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:28:14,902 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 686.67 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.3 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1213.90 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 77.3 MB). Peak memory consumption was 77.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9734.15 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 43.1 MB). Peak memory consumption was 171.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...