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/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:27:14,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:27:14,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:27:14,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:27:14,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:27:14,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:27:14,139 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:27:14,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:27:14,142 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:27:14,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:27:14,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:27:14,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:27:14,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:27:14,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:27:14,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:27:14,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:27:14,149 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:27:14,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:27:14,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:27:14,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:27:14,157 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:27:14,158 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:27:14,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:27:14,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:27:14,161 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:27:14,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:27:14,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:27:14,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:27:14,165 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:27:14,166 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:27:14,166 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:27:14,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:27:14,167 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:27:14,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:27:14,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:27:14,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:27:14,170 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:27:14,197 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:27:14,197 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:27:14,198 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:27:14,199 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:27:14,201 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:27:14,201 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:27:14,201 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:27:14,201 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:27:14,201 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:27:14,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:27:14,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:27:14,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:27:14,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:27:14,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:27:14,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:27:14,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:27:14,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:27:14,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:27:14,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:27:14,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:27:14,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:27:14,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:27:14,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:27:14,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:27:14,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:27:14,210 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:27:14,210 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:27:14,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:27:14,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:27:14,212 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:27:14,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:27:14,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:27:14,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:27:14,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:27:14,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:27:14,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:27:14,359 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b240d18a9/6ce5b4613ae44adb9268c6cdbb72e853/FLAG0858627f3 [2018-11-14 17:27:14,928 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:27:14,929 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:27:14,943 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b240d18a9/6ce5b4613ae44adb9268c6cdbb72e853/FLAG0858627f3 [2018-11-14 17:27:14,960 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b240d18a9/6ce5b4613ae44adb9268c6cdbb72e853 [2018-11-14 17:27:14,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:27:14,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:27:14,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:27:14,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:27:14,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:27:14,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:27:14" (1/1) ... [2018-11-14 17:27:14,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de09f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:14, skipping insertion in model container [2018-11-14 17:27:14,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:27:14" (1/1) ... [2018-11-14 17:27:14,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:27:15,063 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:27:15,435 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:27:15,447 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:27:15,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:27:15,568 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:27:15,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15 WrapperNode [2018-11-14 17:27:15,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:27:15,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:27:15,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:27:15,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:27:15,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (1/1) ... [2018-11-14 17:27:15,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (1/1) ... [2018-11-14 17:27:15,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (1/1) ... [2018-11-14 17:27:15,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (1/1) ... [2018-11-14 17:27:15,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (1/1) ... [2018-11-14 17:27:15,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (1/1) ... [2018-11-14 17:27:15,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (1/1) ... [2018-11-14 17:27:15,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:27:15,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:27:15,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:27:15,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:27:15,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (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:27:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:27:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:27:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:27:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:27:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:27:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 17:27:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-14 17:27:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-14 17:27:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-11-14 17:27:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-11-14 17:27:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:27:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:27:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:27:15,808 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:27:15,808 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:27:15,808 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:27:15,808 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:27:15,808 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:27:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:27:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:27:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:27:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:27:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:27:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:27:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:27:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:27:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:27:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:27:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:27:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:27:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:27:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:27:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:27:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:27:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:27:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:27:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:27:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:27:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:27:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:27:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:27:15,813 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:27:15,813 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:27:15,813 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:27:15,813 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:27:15,813 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:27:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:27:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:27:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:27:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:27:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:27:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:27:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:27:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:27:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:27:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:27:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:27:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:27:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:27:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:27:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:27:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:27:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:27:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:27:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:27:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:27:15,817 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:27:15,817 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:27:15,817 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:27:15,817 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:27:15,817 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:27:15,817 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:27:15,818 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:27:15,818 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:27:15,818 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:27:15,818 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:27:15,818 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:27:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:27:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:27:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:27:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:27:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:27:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:27:15,819 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:27:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:27:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:27:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:27:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:27:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:27:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:27:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:27:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:27:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:27:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:27:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:27:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:27:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:27:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:27:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:27:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:27:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:27:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:27:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:27:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:27:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:27:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:27:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:27:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:27:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:27:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:27:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:27:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:27:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:27:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:27:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:27:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:27:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:27:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 17:27:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:27:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:27:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:27:15,826 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-14 17:27:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-14 17:27:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:27:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:27:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-11-14 17:27:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:27:15,827 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-11-14 17:27:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:27:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:27:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:27:15,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:27:17,372 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:27:17,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:27:17 BoogieIcfgContainer [2018-11-14 17:27:17,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:27:17,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:27:17,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:27:17,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:27:17,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:27:14" (1/3) ... [2018-11-14 17:27:17,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27da4055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:27:17, skipping insertion in model container [2018-11-14 17:27:17,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:27:15" (2/3) ... [2018-11-14 17:27:17,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27da4055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:27:17, skipping insertion in model container [2018-11-14 17:27:17,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:27:17" (3/3) ... [2018-11-14 17:27:17,382 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:27:17,393 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:27:17,406 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:27:17,427 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:27:17,476 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:27:17,477 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:27:17,477 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:27:17,477 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:27:17,477 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:27:17,478 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:27:17,479 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:27:17,479 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:27:17,479 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:27:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-14 17:27:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:27:17,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:27:17,516 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, 1, 1, 1, 1] [2018-11-14 17:27:17,519 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:27:17,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:27:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1643840518, now seen corresponding path program 1 times [2018-11-14 17:27:17,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:27:17,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:27:17,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:17,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:27:17,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:27:17,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {67#true} is VALID [2018-11-14 17:27:17,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {67#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {67#true} is VALID [2018-11-14 17:27:17,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2018-11-14 17:27:17,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #157#return; {67#true} is VALID [2018-11-14 17:27:17,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret17 := main(); {67#true} is VALID [2018-11-14 17:27:17,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {67#true} ~len~0 := 2;~data~0 := 1; {67#true} is VALID [2018-11-14 17:27:17,733 INFO L256 TraceCheckUtils]: 6: Hoare triple {67#true} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {67#true} is VALID [2018-11-14 17:27:17,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {67#true} ~len := #in~len;~data := #in~data; {67#true} is VALID [2018-11-14 17:27:17,733 INFO L256 TraceCheckUtils]: 8: Hoare triple {67#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {67#true} is VALID [2018-11-14 17:27:17,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {67#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; {67#true} is VALID [2018-11-14 17:27:17,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {67#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {67#true} is VALID [2018-11-14 17:27:17,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {67#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {67#true} is VALID [2018-11-14 17:27:17,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {67#true} assume true; {67#true} is VALID [2018-11-14 17:27:17,735 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {67#true} {67#true} #153#return; {67#true} is VALID [2018-11-14 17:27:17,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {67#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {67#true} is VALID [2018-11-14 17:27:17,743 INFO L273 TraceCheckUtils]: 15: Hoare triple {67#true} assume !true; {68#false} is VALID [2018-11-14 17:27:17,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {68#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {68#false} is VALID [2018-11-14 17:27:17,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {68#false} assume true; {68#false} is VALID [2018-11-14 17:27:17,744 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {68#false} {67#true} #145#return; {68#false} is VALID [2018-11-14 17:27:17,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {68#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {68#false} is VALID [2018-11-14 17:27:17,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {68#false} assume !true; {68#false} is VALID [2018-11-14 17:27:17,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {68#false} ~i~0 := ~len~0 - 1; {68#false} is VALID [2018-11-14 17:27:17,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {68#false} assume true; {68#false} is VALID [2018-11-14 17:27:17,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {68#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {68#false} is VALID [2018-11-14 17:27:17,747 INFO L256 TraceCheckUtils]: 24: Hoare triple {68#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {67#true} is VALID [2018-11-14 17:27:17,747 INFO L273 TraceCheckUtils]: 25: Hoare triple {67#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {67#true} is VALID [2018-11-14 17:27:17,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {67#true} assume !true; {67#true} is VALID [2018-11-14 17:27:17,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {67#true} call #t~mem10 := read~int(~head.base, ~head.offset + 4, 4);#res := #t~mem10;havoc #t~mem10; {67#true} is VALID [2018-11-14 17:27:17,748 INFO L273 TraceCheckUtils]: 28: Hoare triple {67#true} assume true; {67#true} is VALID [2018-11-14 17:27:17,749 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {67#true} {68#false} #149#return; {68#false} is VALID [2018-11-14 17:27:17,749 INFO L273 TraceCheckUtils]: 30: Hoare triple {68#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {68#false} is VALID [2018-11-14 17:27:17,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {68#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {68#false} is VALID [2018-11-14 17:27:17,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {68#false} assume !false; {68#false} is VALID [2018-11-14 17:27:17,757 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:27:17,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:27:17,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:27:17,766 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-11-14 17:27:17,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:27:17,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:27:18,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:18,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:27:18,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:27:18,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:27:18,183 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-14 17:27:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:18,536 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2018-11-14 17:27:18,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:27:18,537 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-11-14 17:27:18,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:27:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:27:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 134 transitions. [2018-11-14 17:27:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:27:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 134 transitions. [2018-11-14 17:27:18,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 134 transitions. [2018-11-14 17:27:19,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:19,103 INFO L225 Difference]: With dead ends: 106 [2018-11-14 17:27:19,103 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:27:19,108 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:27:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:27:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-14 17:27:19,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:27:19,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-14 17:27:19,207 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 17:27:19,207 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 17:27:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:19,214 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 17:27:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-14 17:27:19,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:19,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:19,215 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 17:27:19,216 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 17:27:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:19,222 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 17:27:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-14 17:27:19,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:19,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:19,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:27:19,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:27:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:27:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-14 17:27:19,230 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 33 [2018-11-14 17:27:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:27:19,231 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-14 17:27:19,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:27:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-14 17:27:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:27:19,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:27:19,233 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:27:19,234 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:27:19,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:27:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash 51367115, now seen corresponding path program 1 times [2018-11-14 17:27:19,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:27:19,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:27:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:19,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:27:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:27:19,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {376#true} is VALID [2018-11-14 17:27:19,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {376#true} is VALID [2018-11-14 17:27:19,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-14 17:27:19,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {376#true} {376#true} #157#return; {376#true} is VALID [2018-11-14 17:27:19,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {376#true} call #t~ret17 := main(); {376#true} is VALID [2018-11-14 17:27:19,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {376#true} ~len~0 := 2;~data~0 := 1; {378#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:19,462 INFO L256 TraceCheckUtils]: 6: Hoare triple {378#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {376#true} is VALID [2018-11-14 17:27:19,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {376#true} ~len := #in~len;~data := #in~data; {376#true} is VALID [2018-11-14 17:27:19,463 INFO L256 TraceCheckUtils]: 8: Hoare triple {376#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {376#true} is VALID [2018-11-14 17:27:19,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#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; {376#true} is VALID [2018-11-14 17:27:19,464 INFO L273 TraceCheckUtils]: 10: Hoare triple {376#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {376#true} is VALID [2018-11-14 17:27:19,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {376#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {376#true} is VALID [2018-11-14 17:27:19,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-14 17:27:19,465 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {376#true} {376#true} #153#return; {376#true} is VALID [2018-11-14 17:27:19,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {376#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {376#true} is VALID [2018-11-14 17:27:19,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-14 17:27:19,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {376#true} assume !(~len > 1); {376#true} is VALID [2018-11-14 17:27:19,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {376#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {376#true} is VALID [2018-11-14 17:27:19,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-14 17:27:19,480 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {376#true} {378#(<= 2 main_~len~0)} #145#return; {378#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:19,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {378#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {379#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:19,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {379#(<= 1 main_~i~0)} assume true; {379#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:19,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {379#(<= 1 main_~i~0)} assume !(~i~0 > -1); {377#false} is VALID [2018-11-14 17:27:19,491 INFO L273 TraceCheckUtils]: 23: Hoare triple {377#false} ~i~0 := ~len~0 - 1; {377#false} is VALID [2018-11-14 17:27:19,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {377#false} assume true; {377#false} is VALID [2018-11-14 17:27:19,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {377#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {377#false} is VALID [2018-11-14 17:27:19,492 INFO L256 TraceCheckUtils]: 26: Hoare triple {377#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {376#true} is VALID [2018-11-14 17:27:19,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {376#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {376#true} is VALID [2018-11-14 17:27:19,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-14 17:27:19,492 INFO L273 TraceCheckUtils]: 29: Hoare triple {376#true} assume !(~index > 0); {376#true} is VALID [2018-11-14 17:27:19,493 INFO L273 TraceCheckUtils]: 30: Hoare triple {376#true} call #t~mem10 := read~int(~head.base, ~head.offset + 4, 4);#res := #t~mem10;havoc #t~mem10; {376#true} is VALID [2018-11-14 17:27:19,493 INFO L273 TraceCheckUtils]: 31: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-14 17:27:19,493 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {376#true} {377#false} #149#return; {377#false} is VALID [2018-11-14 17:27:19,494 INFO L273 TraceCheckUtils]: 33: Hoare triple {377#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {377#false} is VALID [2018-11-14 17:27:19,494 INFO L273 TraceCheckUtils]: 34: Hoare triple {377#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {377#false} is VALID [2018-11-14 17:27:19,494 INFO L273 TraceCheckUtils]: 35: Hoare triple {377#false} assume !false; {377#false} is VALID [2018-11-14 17:27:19,497 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:27:19,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:27:19,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:27:19,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:27:19,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:27:19,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:27:19,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:19,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:27:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:27:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:27:19,620 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 4 states. [2018-11-14 17:27:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:19,987 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-14 17:27:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:27:19,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:27:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:27:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:27:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-14 17:27:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:27:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-14 17:27:19,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2018-11-14 17:27:20,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:20,163 INFO L225 Difference]: With dead ends: 75 [2018-11-14 17:27:20,163 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:27:20,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:27:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:27:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-11-14 17:27:20,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:27:20,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 50 states. [2018-11-14 17:27:20,233 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 50 states. [2018-11-14 17:27:20,233 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 50 states. [2018-11-14 17:27:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:20,239 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-14 17:27:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-14 17:27:20,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:20,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:20,241 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 60 states. [2018-11-14 17:27:20,241 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 60 states. [2018-11-14 17:27:20,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:20,246 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-14 17:27:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-14 17:27:20,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:20,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:20,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:27:20,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:27:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:27:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-14 17:27:20,252 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 36 [2018-11-14 17:27:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:27:20,253 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-14 17:27:20,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:27:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-14 17:27:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:27:20,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:27:20,255 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:27:20,255 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:27:20,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:27:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1816832551, now seen corresponding path program 1 times [2018-11-14 17:27:20,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:27:20,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:27:20,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:20,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:27:20,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:27:20,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {678#true} call ULTIMATE.init(); {678#true} is VALID [2018-11-14 17:27:20,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {678#true} is VALID [2018-11-14 17:27:20,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {678#true} assume true; {678#true} is VALID [2018-11-14 17:27:20,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {678#true} {678#true} #157#return; {678#true} is VALID [2018-11-14 17:27:20,420 INFO L256 TraceCheckUtils]: 4: Hoare triple {678#true} call #t~ret17 := main(); {678#true} is VALID [2018-11-14 17:27:20,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {678#true} ~len~0 := 2;~data~0 := 1; {680#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:20,421 INFO L256 TraceCheckUtils]: 6: Hoare triple {680#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {678#true} is VALID [2018-11-14 17:27:20,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {678#true} ~len := #in~len;~data := #in~data; {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 17:27:20,427 INFO L256 TraceCheckUtils]: 8: Hoare triple {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {678#true} is VALID [2018-11-14 17:27:20,427 INFO L273 TraceCheckUtils]: 9: Hoare triple {678#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; {678#true} is VALID [2018-11-14 17:27:20,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {678#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {678#true} is VALID [2018-11-14 17:27:20,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {678#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {678#true} is VALID [2018-11-14 17:27:20,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {678#true} assume true; {678#true} is VALID [2018-11-14 17:27:20,432 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {678#true} {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} #153#return; {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 17:27:20,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 17:27:20,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} assume true; {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 17:27:20,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {681#(<= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !(~len > 1); {682#(<= |sll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:27:20,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {682#(<= |sll_circular_create_#in~len| 1)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {682#(<= |sll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:27:20,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {682#(<= |sll_circular_create_#in~len| 1)} assume true; {682#(<= |sll_circular_create_#in~len| 1)} is VALID [2018-11-14 17:27:20,439 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {682#(<= |sll_circular_create_#in~len| 1)} {680#(<= 2 main_~len~0)} #145#return; {679#false} is VALID [2018-11-14 17:27:20,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {679#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {679#false} is VALID [2018-11-14 17:27:20,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {679#false} assume true; {679#false} is VALID [2018-11-14 17:27:20,440 INFO L273 TraceCheckUtils]: 22: Hoare triple {679#false} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {679#false} is VALID [2018-11-14 17:27:20,440 INFO L256 TraceCheckUtils]: 23: Hoare triple {679#false} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {678#true} is VALID [2018-11-14 17:27:20,441 INFO L273 TraceCheckUtils]: 24: Hoare triple {678#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {678#true} is VALID [2018-11-14 17:27:20,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {678#true} assume true; {678#true} is VALID [2018-11-14 17:27:20,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {678#true} assume !(~index > 0); {678#true} is VALID [2018-11-14 17:27:20,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {678#true} call write~int(~data, ~head.base, ~head.offset + 4, 4); {678#true} is VALID [2018-11-14 17:27:20,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {678#true} assume true; {678#true} is VALID [2018-11-14 17:27:20,443 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {678#true} {679#false} #147#return; {679#false} is VALID [2018-11-14 17:27:20,443 INFO L273 TraceCheckUtils]: 30: Hoare triple {679#false} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {679#false} is VALID [2018-11-14 17:27:20,443 INFO L273 TraceCheckUtils]: 31: Hoare triple {679#false} assume true; {679#false} is VALID [2018-11-14 17:27:20,443 INFO L273 TraceCheckUtils]: 32: Hoare triple {679#false} assume !(~i~0 > -1); {679#false} is VALID [2018-11-14 17:27:20,444 INFO L273 TraceCheckUtils]: 33: Hoare triple {679#false} ~i~0 := ~len~0 - 1; {679#false} is VALID [2018-11-14 17:27:20,444 INFO L273 TraceCheckUtils]: 34: Hoare triple {679#false} assume true; {679#false} is VALID [2018-11-14 17:27:20,444 INFO L273 TraceCheckUtils]: 35: Hoare triple {679#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {679#false} is VALID [2018-11-14 17:27:20,444 INFO L256 TraceCheckUtils]: 36: Hoare triple {679#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {678#true} is VALID [2018-11-14 17:27:20,445 INFO L273 TraceCheckUtils]: 37: Hoare triple {678#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {678#true} is VALID [2018-11-14 17:27:20,445 INFO L273 TraceCheckUtils]: 38: Hoare triple {678#true} assume true; {678#true} is VALID [2018-11-14 17:27:20,446 INFO L273 TraceCheckUtils]: 39: Hoare triple {678#true} assume !(~index > 0); {678#true} is VALID [2018-11-14 17:27:20,446 INFO L273 TraceCheckUtils]: 40: Hoare triple {678#true} call #t~mem10 := read~int(~head.base, ~head.offset + 4, 4);#res := #t~mem10;havoc #t~mem10; {678#true} is VALID [2018-11-14 17:27:20,446 INFO L273 TraceCheckUtils]: 41: Hoare triple {678#true} assume true; {678#true} is VALID [2018-11-14 17:27:20,446 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {678#true} {679#false} #149#return; {679#false} is VALID [2018-11-14 17:27:20,447 INFO L273 TraceCheckUtils]: 43: Hoare triple {679#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {679#false} is VALID [2018-11-14 17:27:20,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {679#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {679#false} is VALID [2018-11-14 17:27:20,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {679#false} assume !false; {679#false} is VALID [2018-11-14 17:27:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:27:20,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:27:20,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:27:20,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-14 17:27:20,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:27:20,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:27:20,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:20,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:27:20,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:27:20,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:27:20,539 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-11-14 17:27:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:21,058 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-14 17:27:21,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:27:21,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-14 17:27:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:27:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:27:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2018-11-14 17:27:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:27:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2018-11-14 17:27:21,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 91 transitions. [2018-11-14 17:27:21,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:21,216 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:27:21,217 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:27:21,217 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:27:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:27:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-14 17:27:21,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:27:21,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-14 17:27:21,274 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-14 17:27:21,274 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-14 17:27:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:21,278 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-14 17:27:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-14 17:27:21,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:21,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:21,280 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-14 17:27:21,280 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-14 17:27:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:21,284 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-14 17:27:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-14 17:27:21,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:21,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:21,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:27:21,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:27:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:27:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-14 17:27:21,290 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2018-11-14 17:27:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:27:21,290 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-14 17:27:21,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:27:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 17:27:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:27:21,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:27:21,293 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:27:21,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:27:21,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:27:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1937565944, now seen corresponding path program 1 times [2018-11-14 17:27:21,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:27:21,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:27:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:21,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:27:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:27:21,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2018-11-14 17:27:21,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {985#true} is VALID [2018-11-14 17:27:21,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #157#return; {985#true} is VALID [2018-11-14 17:27:21,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret17 := main(); {985#true} is VALID [2018-11-14 17:27:21,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {985#true} ~len~0 := 2;~data~0 := 1; {987#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:21,509 INFO L256 TraceCheckUtils]: 6: Hoare triple {987#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {985#true} is VALID [2018-11-14 17:27:21,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {985#true} ~len := #in~len;~data := #in~data; {985#true} is VALID [2018-11-14 17:27:21,510 INFO L256 TraceCheckUtils]: 8: Hoare triple {985#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {985#true} is VALID [2018-11-14 17:27:21,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {985#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; {985#true} is VALID [2018-11-14 17:27:21,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {985#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {985#true} is VALID [2018-11-14 17:27:21,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {985#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {985#true} is VALID [2018-11-14 17:27:21,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,511 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {985#true} {985#true} #153#return; {985#true} is VALID [2018-11-14 17:27:21,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {985#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {985#true} is VALID [2018-11-14 17:27:21,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,512 INFO L273 TraceCheckUtils]: 16: Hoare triple {985#true} assume !!(~len > 1); {985#true} is VALID [2018-11-14 17:27:21,512 INFO L256 TraceCheckUtils]: 17: Hoare triple {985#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {985#true} is VALID [2018-11-14 17:27:21,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {985#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; {985#true} is VALID [2018-11-14 17:27:21,513 INFO L273 TraceCheckUtils]: 19: Hoare triple {985#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {985#true} is VALID [2018-11-14 17:27:21,513 INFO L273 TraceCheckUtils]: 20: Hoare triple {985#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {985#true} is VALID [2018-11-14 17:27:21,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,514 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {985#true} {985#true} #155#return; {985#true} is VALID [2018-11-14 17:27:21,514 INFO L273 TraceCheckUtils]: 23: Hoare triple {985#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 + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {985#true} is VALID [2018-11-14 17:27:21,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {985#true} assume !(~len > 1); {985#true} is VALID [2018-11-14 17:27:21,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {985#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {985#true} is VALID [2018-11-14 17:27:21,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,526 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {985#true} {987#(<= 2 main_~len~0)} #145#return; {987#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:21,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {987#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {988#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:21,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {988#(<= 1 main_~i~0)} assume true; {988#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:21,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {988#(<= 1 main_~i~0)} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {988#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:21,532 INFO L256 TraceCheckUtils]: 32: Hoare triple {988#(<= 1 main_~i~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {985#true} is VALID [2018-11-14 17:27:21,532 INFO L273 TraceCheckUtils]: 33: Hoare triple {985#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {985#true} is VALID [2018-11-14 17:27:21,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {985#true} assume !(~index > 0); {985#true} is VALID [2018-11-14 17:27:21,532 INFO L273 TraceCheckUtils]: 36: Hoare triple {985#true} call write~int(~data, ~head.base, ~head.offset + 4, 4); {985#true} is VALID [2018-11-14 17:27:21,533 INFO L273 TraceCheckUtils]: 37: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,534 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {985#true} {988#(<= 1 main_~i~0)} #147#return; {988#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:21,535 INFO L273 TraceCheckUtils]: 39: Hoare triple {988#(<= 1 main_~i~0)} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {989#(<= 0 main_~i~0)} is VALID [2018-11-14 17:27:21,535 INFO L273 TraceCheckUtils]: 40: Hoare triple {989#(<= 0 main_~i~0)} assume true; {989#(<= 0 main_~i~0)} is VALID [2018-11-14 17:27:21,536 INFO L273 TraceCheckUtils]: 41: Hoare triple {989#(<= 0 main_~i~0)} assume !(~i~0 > -1); {986#false} is VALID [2018-11-14 17:27:21,536 INFO L273 TraceCheckUtils]: 42: Hoare triple {986#false} ~i~0 := ~len~0 - 1; {986#false} is VALID [2018-11-14 17:27:21,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 17:27:21,536 INFO L273 TraceCheckUtils]: 44: Hoare triple {986#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {986#false} is VALID [2018-11-14 17:27:21,537 INFO L256 TraceCheckUtils]: 45: Hoare triple {986#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {985#true} is VALID [2018-11-14 17:27:21,537 INFO L273 TraceCheckUtils]: 46: Hoare triple {985#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {985#true} is VALID [2018-11-14 17:27:21,537 INFO L273 TraceCheckUtils]: 47: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,538 INFO L273 TraceCheckUtils]: 48: Hoare triple {985#true} assume !(~index > 0); {985#true} is VALID [2018-11-14 17:27:21,538 INFO L273 TraceCheckUtils]: 49: Hoare triple {985#true} call #t~mem10 := read~int(~head.base, ~head.offset + 4, 4);#res := #t~mem10;havoc #t~mem10; {985#true} is VALID [2018-11-14 17:27:21,538 INFO L273 TraceCheckUtils]: 50: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:21,539 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {985#true} {986#false} #149#return; {986#false} is VALID [2018-11-14 17:27:21,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {986#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {986#false} is VALID [2018-11-14 17:27:21,539 INFO L273 TraceCheckUtils]: 53: Hoare triple {986#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {986#false} is VALID [2018-11-14 17:27:21,539 INFO L273 TraceCheckUtils]: 54: Hoare triple {986#false} assume !false; {986#false} is VALID [2018-11-14 17:27:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:27:21,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:27:21,545 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:27:21,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:27:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:27:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:27:21,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:27:22,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2018-11-14 17:27:22,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {985#true} is VALID [2018-11-14 17:27:22,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:22,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #157#return; {985#true} is VALID [2018-11-14 17:27:22,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret17 := main(); {985#true} is VALID [2018-11-14 17:27:22,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {985#true} ~len~0 := 2;~data~0 := 1; {987#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:22,365 INFO L256 TraceCheckUtils]: 6: Hoare triple {987#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {985#true} is VALID [2018-11-14 17:27:22,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {985#true} ~len := #in~len;~data := #in~data; {985#true} is VALID [2018-11-14 17:27:22,366 INFO L256 TraceCheckUtils]: 8: Hoare triple {985#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {985#true} is VALID [2018-11-14 17:27:22,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {985#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; {985#true} is VALID [2018-11-14 17:27:22,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {985#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {985#true} is VALID [2018-11-14 17:27:22,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {985#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {985#true} is VALID [2018-11-14 17:27:22,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:22,367 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {985#true} {985#true} #153#return; {985#true} is VALID [2018-11-14 17:27:22,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {985#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {985#true} is VALID [2018-11-14 17:27:22,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:22,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {985#true} assume !!(~len > 1); {985#true} is VALID [2018-11-14 17:27:22,368 INFO L256 TraceCheckUtils]: 17: Hoare triple {985#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {985#true} is VALID [2018-11-14 17:27:22,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {985#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; {985#true} is VALID [2018-11-14 17:27:22,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {985#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {985#true} is VALID [2018-11-14 17:27:22,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {985#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {985#true} is VALID [2018-11-14 17:27:22,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:22,369 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {985#true} {985#true} #155#return; {985#true} is VALID [2018-11-14 17:27:22,370 INFO L273 TraceCheckUtils]: 23: Hoare triple {985#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 + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {985#true} is VALID [2018-11-14 17:27:22,370 INFO L273 TraceCheckUtils]: 24: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:22,370 INFO L273 TraceCheckUtils]: 25: Hoare triple {985#true} assume !(~len > 1); {985#true} is VALID [2018-11-14 17:27:22,370 INFO L273 TraceCheckUtils]: 26: Hoare triple {985#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {985#true} is VALID [2018-11-14 17:27:22,371 INFO L273 TraceCheckUtils]: 27: Hoare triple {985#true} assume true; {985#true} is VALID [2018-11-14 17:27:22,374 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {985#true} {987#(<= 2 main_~len~0)} #145#return; {987#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:22,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {987#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {988#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:22,378 INFO L273 TraceCheckUtils]: 30: Hoare triple {988#(<= 1 main_~i~0)} assume true; {988#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:22,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {988#(<= 1 main_~i~0)} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {988#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:22,384 INFO L256 TraceCheckUtils]: 32: Hoare triple {988#(<= 1 main_~i~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {985#true} is VALID [2018-11-14 17:27:22,386 INFO L273 TraceCheckUtils]: 33: Hoare triple {985#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1092#(<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index)} is VALID [2018-11-14 17:27:22,388 INFO L273 TraceCheckUtils]: 34: Hoare triple {1092#(<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index)} assume true; {1092#(<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index)} is VALID [2018-11-14 17:27:22,389 INFO L273 TraceCheckUtils]: 35: Hoare triple {1092#(<= |sll_circular_update_at_#in~index| sll_circular_update_at_~index)} assume !(~index > 0); {1099#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-14 17:27:22,390 INFO L273 TraceCheckUtils]: 36: Hoare triple {1099#(<= |sll_circular_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset + 4, 4); {1099#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-14 17:27:22,390 INFO L273 TraceCheckUtils]: 37: Hoare triple {1099#(<= |sll_circular_update_at_#in~index| 0)} assume true; {1099#(<= |sll_circular_update_at_#in~index| 0)} is VALID [2018-11-14 17:27:22,392 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1099#(<= |sll_circular_update_at_#in~index| 0)} {988#(<= 1 main_~i~0)} #147#return; {986#false} is VALID [2018-11-14 17:27:22,393 INFO L273 TraceCheckUtils]: 39: Hoare triple {986#false} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {986#false} is VALID [2018-11-14 17:27:22,393 INFO L273 TraceCheckUtils]: 40: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 17:27:22,393 INFO L273 TraceCheckUtils]: 41: Hoare triple {986#false} assume !(~i~0 > -1); {986#false} is VALID [2018-11-14 17:27:22,394 INFO L273 TraceCheckUtils]: 42: Hoare triple {986#false} ~i~0 := ~len~0 - 1; {986#false} is VALID [2018-11-14 17:27:22,394 INFO L273 TraceCheckUtils]: 43: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 17:27:22,394 INFO L273 TraceCheckUtils]: 44: Hoare triple {986#false} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {986#false} is VALID [2018-11-14 17:27:22,395 INFO L256 TraceCheckUtils]: 45: Hoare triple {986#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {986#false} is VALID [2018-11-14 17:27:22,395 INFO L273 TraceCheckUtils]: 46: Hoare triple {986#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {986#false} is VALID [2018-11-14 17:27:22,395 INFO L273 TraceCheckUtils]: 47: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 17:27:22,396 INFO L273 TraceCheckUtils]: 48: Hoare triple {986#false} assume !(~index > 0); {986#false} is VALID [2018-11-14 17:27:22,396 INFO L273 TraceCheckUtils]: 49: Hoare triple {986#false} call #t~mem10 := read~int(~head.base, ~head.offset + 4, 4);#res := #t~mem10;havoc #t~mem10; {986#false} is VALID [2018-11-14 17:27:22,396 INFO L273 TraceCheckUtils]: 50: Hoare triple {986#false} assume true; {986#false} is VALID [2018-11-14 17:27:22,397 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {986#false} {986#false} #149#return; {986#false} is VALID [2018-11-14 17:27:22,397 INFO L273 TraceCheckUtils]: 52: Hoare triple {986#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {986#false} is VALID [2018-11-14 17:27:22,397 INFO L273 TraceCheckUtils]: 53: Hoare triple {986#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {986#false} is VALID [2018-11-14 17:27:22,398 INFO L273 TraceCheckUtils]: 54: Hoare triple {986#false} assume !false; {986#false} is VALID [2018-11-14 17:27:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:27:22,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:27:22,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 7 [2018-11-14 17:27:22,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-14 17:27:22,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:27:22,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:27:22,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:22,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:27:22,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:27:22,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:27:22,674 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 7 states. [2018-11-14 17:27:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:23,423 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2018-11-14 17:27:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:27:23,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-11-14 17:27:23,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:27:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:27:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2018-11-14 17:27:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:27:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2018-11-14 17:27:23,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2018-11-14 17:27:23,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:23,573 INFO L225 Difference]: With dead ends: 96 [2018-11-14 17:27:23,573 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 17:27:23,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:27:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 17:27:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2018-11-14 17:27:23,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:27:23,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 61 states. [2018-11-14 17:27:23,715 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 61 states. [2018-11-14 17:27:23,716 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 61 states. [2018-11-14 17:27:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:23,720 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-14 17:27:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2018-11-14 17:27:23,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:23,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:23,722 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 71 states. [2018-11-14 17:27:23,722 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 71 states. [2018-11-14 17:27:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:23,726 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-11-14 17:27:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2018-11-14 17:27:23,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:23,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:23,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:27:23,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:27:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 17:27:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-11-14 17:27:23,732 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 55 [2018-11-14 17:27:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:27:23,733 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-11-14 17:27:23,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:27:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-14 17:27:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 17:27:23,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:27:23,735 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:27:23,735 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:27:23,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:27:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1911955474, now seen corresponding path program 1 times [2018-11-14 17:27:23,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:27:23,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:27:23,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:23,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:27:23,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:27:23,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {1522#true} call ULTIMATE.init(); {1522#true} is VALID [2018-11-14 17:27:23,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {1522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1522#true} is VALID [2018-11-14 17:27:23,930 INFO L273 TraceCheckUtils]: 2: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1522#true} {1522#true} #157#return; {1522#true} is VALID [2018-11-14 17:27:23,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {1522#true} call #t~ret17 := main(); {1522#true} is VALID [2018-11-14 17:27:23,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {1522#true} ~len~0 := 2;~data~0 := 1; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,932 INFO L256 TraceCheckUtils]: 6: Hoare triple {1524#(<= 2 main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1522#true} is VALID [2018-11-14 17:27:23,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {1522#true} ~len := #in~len;~data := #in~data; {1522#true} is VALID [2018-11-14 17:27:23,933 INFO L256 TraceCheckUtils]: 8: Hoare triple {1522#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1522#true} is VALID [2018-11-14 17:27:23,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {1522#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; {1522#true} is VALID [2018-11-14 17:27:23,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {1522#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1522#true} is VALID [2018-11-14 17:27:23,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {1522#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1522#true} is VALID [2018-11-14 17:27:23,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,934 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1522#true} {1522#true} #153#return; {1522#true} is VALID [2018-11-14 17:27:23,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {1522#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1522#true} is VALID [2018-11-14 17:27:23,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {1522#true} assume !!(~len > 1); {1522#true} is VALID [2018-11-14 17:27:23,934 INFO L256 TraceCheckUtils]: 17: Hoare triple {1522#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1522#true} is VALID [2018-11-14 17:27:23,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {1522#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; {1522#true} is VALID [2018-11-14 17:27:23,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {1522#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1522#true} is VALID [2018-11-14 17:27:23,935 INFO L273 TraceCheckUtils]: 20: Hoare triple {1522#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 4, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1522#true} is VALID [2018-11-14 17:27:23,935 INFO L273 TraceCheckUtils]: 21: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,935 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1522#true} {1522#true} #155#return; {1522#true} is VALID [2018-11-14 17:27:23,936 INFO L273 TraceCheckUtils]: 23: Hoare triple {1522#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 + 0, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {1522#true} is VALID [2018-11-14 17:27:23,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {1522#true} assume !(~len > 1); {1522#true} is VALID [2018-11-14 17:27:23,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {1522#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1522#true} is VALID [2018-11-14 17:27:23,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,940 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1522#true} {1524#(<= 2 main_~len~0)} #145#return; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,944 INFO L273 TraceCheckUtils]: 29: Hoare triple {1524#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0;~i~0 := ~len~0 - 1; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {1524#(<= 2 main_~len~0)} assume true; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,950 INFO L273 TraceCheckUtils]: 31: Hoare triple {1524#(<= 2 main_~len~0)} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,950 INFO L256 TraceCheckUtils]: 32: Hoare triple {1524#(<= 2 main_~len~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1522#true} is VALID [2018-11-14 17:27:23,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {1522#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1522#true} is VALID [2018-11-14 17:27:23,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {1522#true} assume !!(~index > 0);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset + 0, 4);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := #t~post12 - 1;havoc #t~post12; {1522#true} is VALID [2018-11-14 17:27:23,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {1522#true} assume !(~index > 0); {1522#true} is VALID [2018-11-14 17:27:23,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {1522#true} call write~int(~data, ~head.base, ~head.offset + 4, 4); {1522#true} is VALID [2018-11-14 17:27:23,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,957 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1522#true} {1524#(<= 2 main_~len~0)} #147#return; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,957 INFO L273 TraceCheckUtils]: 41: Hoare triple {1524#(<= 2 main_~len~0)} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,959 INFO L273 TraceCheckUtils]: 42: Hoare triple {1524#(<= 2 main_~len~0)} assume true; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,959 INFO L273 TraceCheckUtils]: 43: Hoare triple {1524#(<= 2 main_~len~0)} assume !!(~i~0 > -1);~new_data~0 := ~i~0 + ~len~0; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,959 INFO L256 TraceCheckUtils]: 44: Hoare triple {1524#(<= 2 main_~len~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1522#true} is VALID [2018-11-14 17:27:23,959 INFO L273 TraceCheckUtils]: 45: Hoare triple {1522#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1522#true} is VALID [2018-11-14 17:27:23,960 INFO L273 TraceCheckUtils]: 46: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,960 INFO L273 TraceCheckUtils]: 47: Hoare triple {1522#true} assume !(~index > 0); {1522#true} is VALID [2018-11-14 17:27:23,960 INFO L273 TraceCheckUtils]: 48: Hoare triple {1522#true} call write~int(~data, ~head.base, ~head.offset + 4, 4); {1522#true} is VALID [2018-11-14 17:27:23,960 INFO L273 TraceCheckUtils]: 49: Hoare triple {1522#true} assume true; {1522#true} is VALID [2018-11-14 17:27:23,963 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1522#true} {1524#(<= 2 main_~len~0)} #147#return; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,965 INFO L273 TraceCheckUtils]: 51: Hoare triple {1524#(<= 2 main_~len~0)} #t~post14 := ~i~0;~i~0 := #t~post14 - 1;havoc #t~post14; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,965 INFO L273 TraceCheckUtils]: 52: Hoare triple {1524#(<= 2 main_~len~0)} assume true; {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,967 INFO L273 TraceCheckUtils]: 53: Hoare triple {1524#(<= 2 main_~len~0)} assume !(~i~0 > -1); {1524#(<= 2 main_~len~0)} is VALID [2018-11-14 17:27:23,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {1524#(<= 2 main_~len~0)} ~i~0 := ~len~0 - 1; {1525#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:23,969 INFO L273 TraceCheckUtils]: 55: Hoare triple {1525#(<= 1 main_~i~0)} assume true; {1525#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:23,969 INFO L273 TraceCheckUtils]: 56: Hoare triple {1525#(<= 1 main_~i~0)} assume !!(~i~0 > -1);~expected~0 := ~i~0 + ~len~0; {1525#(<= 1 main_~i~0)} is VALID [2018-11-14 17:27:23,970 INFO L256 TraceCheckUtils]: 57: Hoare triple {1525#(<= 1 main_~i~0)} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1522#true} is VALID [2018-11-14 17:27:23,971 INFO L273 TraceCheckUtils]: 58: Hoare triple {1522#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1526#(<= |sll_circular_get_data_at_#in~index| sll_circular_get_data_at_~index)} is VALID [2018-11-14 17:27:23,971 INFO L273 TraceCheckUtils]: 59: Hoare triple {1526#(<= |sll_circular_get_data_at_#in~index| sll_circular_get_data_at_~index)} assume true; {1526#(<= |sll_circular_get_data_at_#in~index| sll_circular_get_data_at_~index)} is VALID [2018-11-14 17:27:23,973 INFO L273 TraceCheckUtils]: 60: Hoare triple {1526#(<= |sll_circular_get_data_at_#in~index| sll_circular_get_data_at_~index)} assume !(~index > 0); {1527#(<= |sll_circular_get_data_at_#in~index| 0)} is VALID [2018-11-14 17:27:23,973 INFO L273 TraceCheckUtils]: 61: Hoare triple {1527#(<= |sll_circular_get_data_at_#in~index| 0)} call #t~mem10 := read~int(~head.base, ~head.offset + 4, 4);#res := #t~mem10;havoc #t~mem10; {1527#(<= |sll_circular_get_data_at_#in~index| 0)} is VALID [2018-11-14 17:27:23,975 INFO L273 TraceCheckUtils]: 62: Hoare triple {1527#(<= |sll_circular_get_data_at_#in~index| 0)} assume true; {1527#(<= |sll_circular_get_data_at_#in~index| 0)} is VALID [2018-11-14 17:27:23,976 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {1527#(<= |sll_circular_get_data_at_#in~index| 0)} {1525#(<= 1 main_~i~0)} #149#return; {1523#false} is VALID [2018-11-14 17:27:23,976 INFO L273 TraceCheckUtils]: 64: Hoare triple {1523#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {1523#false} is VALID [2018-11-14 17:27:23,976 INFO L273 TraceCheckUtils]: 65: Hoare triple {1523#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1523#false} is VALID [2018-11-14 17:27:23,976 INFO L273 TraceCheckUtils]: 66: Hoare triple {1523#false} assume !false; {1523#false} is VALID [2018-11-14 17:27:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-14 17:27:23,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:27:23,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:27:23,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-14 17:27:23,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:27:23,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:27:24,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:24,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:27:24,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:27:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:27:24,044 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 6 states. [2018-11-14 17:27:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:24,548 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-14 17:27:24,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:27:24,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-14 17:27:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:27:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:27:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-14 17:27:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:27:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-14 17:27:24,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2018-11-14 17:27:24,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:27:24,734 INFO L225 Difference]: With dead ends: 88 [2018-11-14 17:27:24,734 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 17:27:24,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:27:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 17:27:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-11-14 17:27:24,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:27:24,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 69 states. [2018-11-14 17:27:24,838 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 69 states. [2018-11-14 17:27:24,838 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 69 states. [2018-11-14 17:27:24,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:24,845 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-14 17:27:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-14 17:27:24,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:24,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:24,847 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 74 states. [2018-11-14 17:27:24,847 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 74 states. [2018-11-14 17:27:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:27:24,851 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-14 17:27:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-14 17:27:24,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:27:24,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:27:24,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:27:24,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:27:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 17:27:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2018-11-14 17:27:24,856 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 67 [2018-11-14 17:27:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:27:24,857 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-11-14 17:27:24,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:27:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-11-14 17:27:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 17:27:24,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:27:24,859 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:27:24,859 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:27:24,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:27:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash -885513068, now seen corresponding path program 1 times [2018-11-14 17:27:24,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:27:24,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:27:24,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:24,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:27:24,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:27:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:27:26,876 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:27:26,882 INFO L168 Benchmark]: Toolchain (without parser) took 11911.62 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.9 MB). Peak memory consumption was 37.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:27:26,884 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:27:26,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:27:26,886 INFO L168 Benchmark]: Boogie Preprocessor took 178.45 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:27:26,886 INFO L168 Benchmark]: RCFGBuilder took 1624.76 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:27:26,887 INFO L168 Benchmark]: TraceAbstraction took 9506.76 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 141.6 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -116.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:27:26,892 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 596.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 178.45 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1624.76 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.0 MB). Peak memory consumption was 66.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9506.76 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 141.6 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -116.1 MB). Peak memory consumption was 25.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...