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/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:24:02,824 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:24:02,826 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:24:02,840 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:24:02,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:24:02,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:24:02,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:24:02,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:24:02,846 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:24:02,847 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:24:02,848 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:24:02,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:24:02,849 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:24:02,851 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:24:02,852 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:24:02,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:24:02,853 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:24:02,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:24:02,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:24:02,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:24:02,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:24:02,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:24:02,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:24:02,864 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:24:02,864 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:24:02,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:24:02,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:24:02,867 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:24:02,868 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:24:02,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:24:02,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:24:02,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:24:02,870 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:24:02,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:24:02,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:24:02,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:24:02,873 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:24:02,888 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:24:02,889 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:24:02,890 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:24:02,890 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:24:02,890 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:24:02,891 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:24:02,891 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:24:02,891 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:24:02,891 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:24:02,892 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:24:02,892 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:24:02,892 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:24:02,892 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:24:02,892 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:24:02,893 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:24:02,893 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:24:02,893 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:24:02,893 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:24:02,894 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:24:02,894 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:24:02,894 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:24:02,894 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:24:02,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:24:02,895 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:24:02,895 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:24:02,895 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:24:02,895 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:24:02,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:24:02,896 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:24:02,897 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:24:02,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:24:02,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:24:02,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:24:02,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:24:02,987 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:24:02,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:03,052 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9a6b9e7/3c28bdd8468b4b428854a31daa228f8e/FLAGbf4bbce22 [2018-11-14 17:24:03,625 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:24:03,630 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:03,658 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9a6b9e7/3c28bdd8468b4b428854a31daa228f8e/FLAGbf4bbce22 [2018-11-14 17:24:03,680 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9a6b9e7/3c28bdd8468b4b428854a31daa228f8e [2018-11-14 17:24:03,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:24:03,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:24:03,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:24:03,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:24:03,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:24:03,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5ab3fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:03, skipping insertion in model container [2018-11-14 17:24:03,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:03" (1/1) ... [2018-11-14 17:24:03,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:24:03,770 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:24:04,179 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:24:04,192 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:24:04,269 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:24:04,323 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:24:04,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04 WrapperNode [2018-11-14 17:24:04,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:24:04,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:24:04,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:24:04,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:24:04,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (1/1) ... [2018-11-14 17:24:04,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (1/1) ... [2018-11-14 17:24:04,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (1/1) ... [2018-11-14 17:24:04,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (1/1) ... [2018-11-14 17:24:04,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (1/1) ... [2018-11-14 17:24:04,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (1/1) ... [2018-11-14 17:24:04,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (1/1) ... [2018-11-14 17:24:04,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:24:04,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:24:04,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:24:04,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:24:04,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (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:24:04,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:24:04,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:24:04,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:24:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:24:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:24:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:24:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:24:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:24:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:24:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:24:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:24:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:24:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:24:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:24:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:24:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:24:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:24:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:24:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:24:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:24:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:24:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:24:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:24:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:24:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:24:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:24:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:24:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:24:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:24:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:24:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:24:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:24:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:24:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:24:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:24:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:24:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:24:04,579 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:24:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:24:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:24:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:24:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:24:04,581 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:24:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:24:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:24:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:24:04,582 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:24:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:24:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:24:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:24:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:24:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:24:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:24:04,583 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:24:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:24:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:24:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:24:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:24:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:24:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:24:04,584 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:24:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:24:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:24:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:24:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:24:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:24:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:24:04,585 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:24:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:24:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:24:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:24:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:24:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:24:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:24:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:24:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:24:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:24:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:24:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:24:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:24:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:24:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:24:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:24:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:24:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:24:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:24:04,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:24:04,591 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:24:04,591 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:24:04,591 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:24:04,592 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:24:04,592 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:24:04,592 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:24:04,592 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:24:04,592 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:24:04,592 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:24:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:24:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:24:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:24:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:24:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:24:04,593 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:24:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:24:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:24:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:24:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:24:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:24:04,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:24:04,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:24:04,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:24:04,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:24:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:24:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:24:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:24:04,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:24:06,537 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:24:06,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:06 BoogieIcfgContainer [2018-11-14 17:24:06,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:24:06,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:24:06,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:24:06,543 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:24:06,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:24:03" (1/3) ... [2018-11-14 17:24:06,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ea9066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:06, skipping insertion in model container [2018-11-14 17:24:06,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:04" (2/3) ... [2018-11-14 17:24:06,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ea9066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:06, skipping insertion in model container [2018-11-14 17:24:06,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:06" (3/3) ... [2018-11-14 17:24:06,547 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:06,557 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:24:06,565 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-14 17:24:06,582 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-14 17:24:06,617 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:24:06,618 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:24:06,618 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:24:06,618 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:24:06,618 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:24:06,619 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:24:06,619 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:24:06,619 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:24:06,619 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:24:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-11-14 17:24:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-14 17:24:06,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:06,650 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:06,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:06,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1590476792, now seen corresponding path program 1 times [2018-11-14 17:24:06,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:06,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:06,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:06,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:07,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {102#true} call ULTIMATE.init(); {102#true} is VALID [2018-11-14 17:24:07,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {102#true} is VALID [2018-11-14 17:24:07,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {102#true} assume true; {102#true} is VALID [2018-11-14 17:24:07,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {102#true} {102#true} #355#return; {102#true} is VALID [2018-11-14 17:24:07,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {102#true} call #t~ret28 := main(); {102#true} is VALID [2018-11-14 17:24:07,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {102#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {104#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:07,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {104#(not (= 0 main_~list~0.base))} assume true; {104#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:07,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {104#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {103#false} is VALID [2018-11-14 17:24:07,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {103#false} assume !false; {103#false} is VALID [2018-11-14 17:24:07,055 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:24:07,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:07,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:24:07,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 17:24:07,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:07,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:24:07,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:07,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:24:07,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:24:07,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:07,135 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2018-11-14 17:24:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:07,609 INFO L93 Difference]: Finished difference Result 210 states and 326 transitions. [2018-11-14 17:24:07,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:24:07,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-14 17:24:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2018-11-14 17:24:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2018-11-14 17:24:07,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 326 transitions. [2018-11-14 17:24:08,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:08,491 INFO L225 Difference]: With dead ends: 210 [2018-11-14 17:24:08,492 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 17:24:08,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 17:24:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-14 17:24:08,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:08,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 92 states. [2018-11-14 17:24:08,560 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 92 states. [2018-11-14 17:24:08,560 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 92 states. [2018-11-14 17:24:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:08,569 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-11-14 17:24:08,570 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-11-14 17:24:08,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:08,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:08,571 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 112 states. [2018-11-14 17:24:08,572 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 112 states. [2018-11-14 17:24:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:08,580 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-11-14 17:24:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-11-14 17:24:08,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:08,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:08,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:08,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:24:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-14 17:24:08,590 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 9 [2018-11-14 17:24:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:08,591 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-14 17:24:08,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:24:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-14 17:24:08,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:24:08,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:08,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:08,593 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:08,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:08,593 INFO L82 PathProgramCache]: Analyzing trace with hash 528636434, now seen corresponding path program 1 times [2018-11-14 17:24:08,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:08,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:08,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:08,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {660#true} call ULTIMATE.init(); {660#true} is VALID [2018-11-14 17:24:08,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {660#true} is VALID [2018-11-14 17:24:08,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {660#true} assume true; {660#true} is VALID [2018-11-14 17:24:08,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {660#true} {660#true} #355#return; {660#true} is VALID [2018-11-14 17:24:08,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {660#true} call #t~ret28 := main(); {660#true} is VALID [2018-11-14 17:24:08,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {660#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {660#true} is VALID [2018-11-14 17:24:08,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {660#true} assume true; {660#true} is VALID [2018-11-14 17:24:08,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {660#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {660#true} is VALID [2018-11-14 17:24:08,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {660#true} assume true; {660#true} is VALID [2018-11-14 17:24:08,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {660#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {660#true} is VALID [2018-11-14 17:24:08,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {660#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {660#true} is VALID [2018-11-14 17:24:08,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {660#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {660#true} is VALID [2018-11-14 17:24:08,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {660#true} assume #t~short7; {662#|main_#t~short7|} is VALID [2018-11-14 17:24:08,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {662#|main_#t~short7|} assume !#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {661#false} is VALID [2018-11-14 17:24:08,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {661#false} assume !false; {661#false} is VALID [2018-11-14 17:24:08,678 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:24:08,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:08,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:24:08,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:24:08,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:08,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:24:08,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:08,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:24:08,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:24:08,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:08,709 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 3 states. [2018-11-14 17:24:08,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:08,932 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-11-14 17:24:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:24:08,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:24:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 17:24:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 17:24:08,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-14 17:24:09,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:09,094 INFO L225 Difference]: With dead ends: 95 [2018-11-14 17:24:09,094 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 17:24:09,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 17:24:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-14 17:24:09,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:09,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2018-11-14 17:24:09,152 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-14 17:24:09,153 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-14 17:24:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:09,158 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-14 17:24:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-14 17:24:09,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:09,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:09,160 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2018-11-14 17:24:09,160 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2018-11-14 17:24:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:09,165 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-14 17:24:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-14 17:24:09,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:09,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:09,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:09,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 17:24:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-11-14 17:24:09,171 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 15 [2018-11-14 17:24:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:09,172 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-11-14 17:24:09,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:24:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-14 17:24:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:24:09,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:09,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:09,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:09,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash 528638356, now seen corresponding path program 1 times [2018-11-14 17:24:09,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:09,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:09,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:09,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2018-11-14 17:24:09,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {1059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1059#true} is VALID [2018-11-14 17:24:09,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-14 17:24:09,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #355#return; {1059#true} is VALID [2018-11-14 17:24:09,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret28 := main(); {1059#true} is VALID [2018-11-14 17:24:09,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {1059#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {1059#true} is VALID [2018-11-14 17:24:09,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-14 17:24:09,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {1059#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1059#true} is VALID [2018-11-14 17:24:09,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {1059#true} assume true; {1059#true} is VALID [2018-11-14 17:24:09,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {1059#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1059#true} is VALID [2018-11-14 17:24:09,315 INFO L273 TraceCheckUtils]: 10: Hoare triple {1059#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {1059#true} is VALID [2018-11-14 17:24:09,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {1059#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1061#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2018-11-14 17:24:09,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {1062#|main_#t~short7|} is VALID [2018-11-14 17:24:09,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {1062#|main_#t~short7|} assume !#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1060#false} is VALID [2018-11-14 17:24:09,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2018-11-14 17:24:09,321 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:24:09,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:24:09,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 17:24:09,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:09,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:24:09,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:09,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:24:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:24:09,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:09,359 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 4 states. [2018-11-14 17:24:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:09,667 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-11-14 17:24:09,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:24:09,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 17:24:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2018-11-14 17:24:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2018-11-14 17:24:09,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2018-11-14 17:24:09,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:09,810 INFO L225 Difference]: With dead ends: 95 [2018-11-14 17:24:09,810 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 17:24:09,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 17:24:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-11-14 17:24:09,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:09,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 90 states. [2018-11-14 17:24:09,845 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 90 states. [2018-11-14 17:24:09,845 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 90 states. [2018-11-14 17:24:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:09,849 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-14 17:24:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-14 17:24:09,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:09,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:09,851 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 93 states. [2018-11-14 17:24:09,851 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 93 states. [2018-11-14 17:24:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:09,855 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-14 17:24:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-14 17:24:09,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:09,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:09,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:09,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 17:24:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-14 17:24:09,861 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 15 [2018-11-14 17:24:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:09,861 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-14 17:24:09,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:24:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-14 17:24:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:24:09,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:09,862 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] [2018-11-14 17:24:09,863 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:09,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 800249225, now seen corresponding path program 1 times [2018-11-14 17:24:09,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:09,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:09,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:09,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:10,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-14 17:24:10,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1456#true} is VALID [2018-11-14 17:24:10,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-14 17:24:10,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #355#return; {1456#true} is VALID [2018-11-14 17:24:10,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret28 := main(); {1456#true} is VALID [2018-11-14 17:24:10,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {1456#true} is VALID [2018-11-14 17:24:10,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-14 17:24:10,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {1456#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1456#true} is VALID [2018-11-14 17:24:10,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-14 17:24:10,027 INFO L273 TraceCheckUtils]: 9: Hoare triple {1456#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1456#true} is VALID [2018-11-14 17:24:10,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {1456#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {1458#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 17:24:10,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {1458#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1459#(not |main_#t~short7|)} is VALID [2018-11-14 17:24:10,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {1459#(not |main_#t~short7|)} assume #t~short7; {1457#false} is VALID [2018-11-14 17:24:10,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {1457#false} assume !!#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {1457#false} is VALID [2018-11-14 17:24:10,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {1457#false} assume true; {1457#false} is VALID [2018-11-14 17:24:10,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {1457#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1457#false} is VALID [2018-11-14 17:24:10,034 INFO L273 TraceCheckUtils]: 16: Hoare triple {1457#false} assume true; {1457#false} is VALID [2018-11-14 17:24:10,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {1457#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1457#false} is VALID [2018-11-14 17:24:10,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {1457#false} assume !!(#t~nondet8 != 0);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, #t~mem10.offset + 4, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4); {1457#false} is VALID [2018-11-14 17:24:10,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {1457#false} assume true; {1457#false} is VALID [2018-11-14 17:24:10,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {1457#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {1457#false} is VALID [2018-11-14 17:24:10,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-14 17:24:10,038 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:24:10,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:10,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:24:10,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-14 17:24:10,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:10,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:24:10,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:10,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:24:10,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:24:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:10,077 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 4 states. [2018-11-14 17:24:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:10,632 INFO L93 Difference]: Finished difference Result 228 states and 250 transitions. [2018-11-14 17:24:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:24:10,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-14 17:24:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2018-11-14 17:24:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2018-11-14 17:24:10,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2018-11-14 17:24:11,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:11,106 INFO L225 Difference]: With dead ends: 228 [2018-11-14 17:24:11,107 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 17:24:11,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:24:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 17:24:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 92. [2018-11-14 17:24:11,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:11,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 92 states. [2018-11-14 17:24:11,149 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 92 states. [2018-11-14 17:24:11,149 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 92 states. [2018-11-14 17:24:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:11,154 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2018-11-14 17:24:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2018-11-14 17:24:11,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:11,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:11,156 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 151 states. [2018-11-14 17:24:11,156 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 151 states. [2018-11-14 17:24:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:11,162 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2018-11-14 17:24:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2018-11-14 17:24:11,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:11,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:11,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:11,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:24:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-14 17:24:11,167 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 22 [2018-11-14 17:24:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:11,167 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-14 17:24:11,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:24:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-14 17:24:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:24:11,168 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:11,168 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] [2018-11-14 17:24:11,169 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:11,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:11,169 INFO L82 PathProgramCache]: Analyzing trace with hash 407222215, now seen corresponding path program 1 times [2018-11-14 17:24:11,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:11,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:11,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:11,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:11,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {2115#true} call ULTIMATE.init(); {2115#true} is VALID [2018-11-14 17:24:11,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {2115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2115#true} is VALID [2018-11-14 17:24:11,355 INFO L273 TraceCheckUtils]: 2: Hoare triple {2115#true} assume true; {2115#true} is VALID [2018-11-14 17:24:11,355 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2115#true} {2115#true} #355#return; {2115#true} is VALID [2018-11-14 17:24:11,355 INFO L256 TraceCheckUtils]: 4: Hoare triple {2115#true} call #t~ret28 := main(); {2115#true} is VALID [2018-11-14 17:24:11,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {2115#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume true; {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume true; {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume !!#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} assume true; {2117#(= (select |#valid| main_~list~0.base) 1)} is VALID [2018-11-14 17:24:11,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {2117#(= (select |#valid| main_~list~0.base) 1)} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2118#(= (select |#valid| main_~end~0.base) 1)} is VALID [2018-11-14 17:24:11,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {2118#(= (select |#valid| main_~end~0.base) 1)} assume true; {2118#(= (select |#valid| main_~end~0.base) 1)} is VALID [2018-11-14 17:24:11,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {2118#(= (select |#valid| main_~end~0.base) 1)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2118#(= (select |#valid| main_~end~0.base) 1)} is VALID [2018-11-14 17:24:11,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {2118#(= (select |#valid| main_~end~0.base) 1)} assume !!(#t~nondet8 != 0);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, #t~mem10.offset + 4, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4); {2119#(not (= main_~end~0.base 0))} is VALID [2018-11-14 17:24:11,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {2119#(not (= main_~end~0.base 0))} assume true; {2119#(not (= main_~end~0.base 0))} is VALID [2018-11-14 17:24:11,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {2119#(not (= main_~end~0.base 0))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2116#false} is VALID [2018-11-14 17:24:11,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {2116#false} assume !false; {2116#false} is VALID [2018-11-14 17:24:11,377 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:24:11,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:11,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:24:11,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 17:24:11,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:11,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:24:11,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:11,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:24:11,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:24:11,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:24:11,404 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 5 states. [2018-11-14 17:24:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:12,136 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-11-14 17:24:12,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:24:12,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 17:24:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2018-11-14 17:24:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2018-11-14 17:24:12,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 157 transitions. [2018-11-14 17:24:12,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:12,378 INFO L225 Difference]: With dead ends: 145 [2018-11-14 17:24:12,379 INFO L226 Difference]: Without dead ends: 141 [2018-11-14 17:24:12,379 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:24:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-14 17:24:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 88. [2018-11-14 17:24:12,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:12,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 88 states. [2018-11-14 17:24:12,413 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 88 states. [2018-11-14 17:24:12,413 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 88 states. [2018-11-14 17:24:12,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:12,417 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-11-14 17:24:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2018-11-14 17:24:12,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:12,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:12,418 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 141 states. [2018-11-14 17:24:12,418 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 141 states. [2018-11-14 17:24:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:12,422 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-11-14 17:24:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2018-11-14 17:24:12,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:12,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:12,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:12,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 17:24:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-14 17:24:12,427 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 22 [2018-11-14 17:24:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:12,427 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-14 17:24:12,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:24:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-14 17:24:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:24:12,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:12,428 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] [2018-11-14 17:24:12,429 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:12,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash -260673469, now seen corresponding path program 1 times [2018-11-14 17:24:12,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:12,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:12,539 INFO L256 TraceCheckUtils]: 0: Hoare triple {2664#true} call ULTIMATE.init(); {2664#true} is VALID [2018-11-14 17:24:12,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {2664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2664#true} is VALID [2018-11-14 17:24:12,540 INFO L273 TraceCheckUtils]: 2: Hoare triple {2664#true} assume true; {2664#true} is VALID [2018-11-14 17:24:12,540 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2664#true} {2664#true} #355#return; {2664#true} is VALID [2018-11-14 17:24:12,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {2664#true} call #t~ret28 := main(); {2664#true} is VALID [2018-11-14 17:24:12,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {2664#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume true; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume true; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume !!#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume true; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {2666#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume true; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {2666#(not (= 0 main_~list~0.base))} assume !(#t~nondet8 != 0);havoc #t~nondet8; {2666#(not (= 0 main_~list~0.base))} is VALID [2018-11-14 17:24:12,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {2666#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {2667#(not (= 0 main_~end~0.base))} is VALID [2018-11-14 17:24:12,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {2667#(not (= 0 main_~end~0.base))} assume true; {2667#(not (= 0 main_~end~0.base))} is VALID [2018-11-14 17:24:12,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {2667#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {2665#false} is VALID [2018-11-14 17:24:12,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {2665#false} assume !false; {2665#false} is VALID [2018-11-14 17:24:12,557 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:24:12,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:12,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:24:12,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-14 17:24:12,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:12,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:24:12,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:12,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:24:12,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:24:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:12,591 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 4 states. [2018-11-14 17:24:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:13,237 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2018-11-14 17:24:13,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:24:13,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-14 17:24:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2018-11-14 17:24:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2018-11-14 17:24:13,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2018-11-14 17:24:13,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:13,770 INFO L225 Difference]: With dead ends: 155 [2018-11-14 17:24:13,770 INFO L226 Difference]: Without dead ends: 133 [2018-11-14 17:24:13,770 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:24:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-14 17:24:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2018-11-14 17:24:14,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:14,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 88 states. [2018-11-14 17:24:14,131 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 88 states. [2018-11-14 17:24:14,131 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 88 states. [2018-11-14 17:24:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:14,136 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-11-14 17:24:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-11-14 17:24:14,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:14,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:14,136 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 133 states. [2018-11-14 17:24:14,136 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 133 states. [2018-11-14 17:24:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:14,140 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-11-14 17:24:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-11-14 17:24:14,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:14,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:14,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:14,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 17:24:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-11-14 17:24:14,145 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 23 [2018-11-14 17:24:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:14,145 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-11-14 17:24:14,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:24:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-11-14 17:24:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:24:14,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:14,146 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] [2018-11-14 17:24:14,147 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:14,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1441611381, now seen corresponding path program 1 times [2018-11-14 17:24:14,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:14,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:14,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:14,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {3204#true} call ULTIMATE.init(); {3204#true} is VALID [2018-11-14 17:24:14,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {3204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3204#true} is VALID [2018-11-14 17:24:14,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {3204#true} assume true; {3204#true} is VALID [2018-11-14 17:24:14,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3204#true} {3204#true} #355#return; {3204#true} is VALID [2018-11-14 17:24:14,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {3204#true} call #t~ret28 := main(); {3204#true} is VALID [2018-11-14 17:24:14,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {3204#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {3204#true} is VALID [2018-11-14 17:24:14,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {3204#true} assume true; {3204#true} is VALID [2018-11-14 17:24:14,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {3204#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3204#true} is VALID [2018-11-14 17:24:14,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {3204#true} assume true; {3204#true} is VALID [2018-11-14 17:24:14,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {3204#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3204#true} is VALID [2018-11-14 17:24:14,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {3204#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {3204#true} is VALID [2018-11-14 17:24:14,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {3204#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3204#true} is VALID [2018-11-14 17:24:14,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {3204#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {3204#true} is VALID [2018-11-14 17:24:14,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {3204#true} assume !!#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {3204#true} is VALID [2018-11-14 17:24:14,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {3204#true} assume true; {3204#true} is VALID [2018-11-14 17:24:14,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {3204#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3204#true} is VALID [2018-11-14 17:24:14,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {3204#true} assume true; {3204#true} is VALID [2018-11-14 17:24:14,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {3204#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3204#true} is VALID [2018-11-14 17:24:14,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {3204#true} assume !(#t~nondet8 != 0);havoc #t~nondet8; {3204#true} is VALID [2018-11-14 17:24:14,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {3204#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3204#true} is VALID [2018-11-14 17:24:14,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {3204#true} assume true; {3204#true} is VALID [2018-11-14 17:24:14,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {3204#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {3204#true} is VALID [2018-11-14 17:24:14,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {3204#true} assume true; {3204#true} is VALID [2018-11-14 17:24:14,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {3204#true} assume true; {3204#true} is VALID [2018-11-14 17:24:14,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {3204#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3206#(= main_~len~0 0)} is VALID [2018-11-14 17:24:14,413 INFO L273 TraceCheckUtils]: 25: Hoare triple {3206#(= main_~len~0 0)} assume true; {3206#(= main_~len~0 0)} is VALID [2018-11-14 17:24:14,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {3206#(= main_~len~0 0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {3206#(= main_~len~0 0)} is VALID [2018-11-14 17:24:14,439 INFO L273 TraceCheckUtils]: 27: Hoare triple {3206#(= main_~len~0 0)} assume true; {3206#(= main_~len~0 0)} is VALID [2018-11-14 17:24:14,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {3206#(= main_~len~0 0)} assume !(~len~0 <= 1); {3205#false} is VALID [2018-11-14 17:24:14,453 INFO L273 TraceCheckUtils]: 29: Hoare triple {3205#false} assume !false; {3205#false} is VALID [2018-11-14 17:24:14,454 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:24:14,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:14,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:24:14,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 17:24:14,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:14,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:24:14,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:14,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:24:14,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:24:14,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:14,536 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 3 states. [2018-11-14 17:24:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:14,946 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2018-11-14 17:24:14,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:24:14,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 17:24:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2018-11-14 17:24:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2018-11-14 17:24:14,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 178 transitions. [2018-11-14 17:24:15,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:15,111 INFO L225 Difference]: With dead ends: 164 [2018-11-14 17:24:15,112 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 17:24:15,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 17:24:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-11-14 17:24:15,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:15,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 93 states. [2018-11-14 17:24:15,145 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 93 states. [2018-11-14 17:24:15,146 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 93 states. [2018-11-14 17:24:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:15,149 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-11-14 17:24:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-11-14 17:24:15,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:15,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:15,150 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 117 states. [2018-11-14 17:24:15,150 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 117 states. [2018-11-14 17:24:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:15,154 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-11-14 17:24:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2018-11-14 17:24:15,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:15,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:15,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:15,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 17:24:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-14 17:24:15,157 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 30 [2018-11-14 17:24:15,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:15,158 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-14 17:24:15,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:24:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-14 17:24:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:24:15,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:15,158 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] [2018-11-14 17:24:15,159 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:15,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1740492039, now seen corresponding path program 1 times [2018-11-14 17:24:15,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:15,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:15,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:15,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:15,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:15,232 INFO L256 TraceCheckUtils]: 0: Hoare triple {3725#true} call ULTIMATE.init(); {3725#true} is VALID [2018-11-14 17:24:15,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {3725#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3725#true} is VALID [2018-11-14 17:24:15,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,233 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3725#true} {3725#true} #355#return; {3725#true} is VALID [2018-11-14 17:24:15,233 INFO L256 TraceCheckUtils]: 4: Hoare triple {3725#true} call #t~ret28 := main(); {3725#true} is VALID [2018-11-14 17:24:15,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {3725#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {3725#true} is VALID [2018-11-14 17:24:15,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {3725#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {3725#true} is VALID [2018-11-14 17:24:15,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {3725#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3725#true} is VALID [2018-11-14 17:24:15,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {3725#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {3725#true} is VALID [2018-11-14 17:24:15,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {3725#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {3725#true} is VALID [2018-11-14 17:24:15,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {3725#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {3725#true} is VALID [2018-11-14 17:24:15,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {3725#true} assume !!#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {3725#true} is VALID [2018-11-14 17:24:15,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {3725#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3725#true} is VALID [2018-11-14 17:24:15,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {3725#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3725#true} is VALID [2018-11-14 17:24:15,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {3725#true} assume !(#t~nondet8 != 0);havoc #t~nondet8; {3725#true} is VALID [2018-11-14 17:24:15,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {3725#true} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {3725#true} is VALID [2018-11-14 17:24:15,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {3725#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {3725#true} is VALID [2018-11-14 17:24:15,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {3725#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {3725#true} is VALID [2018-11-14 17:24:15,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {3725#true} assume true; {3725#true} is VALID [2018-11-14 17:24:15,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {3725#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {3727#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} is VALID [2018-11-14 17:24:15,238 INFO L273 TraceCheckUtils]: 27: Hoare triple {3727#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} assume ~len~0 == 0;~len~0 := 1; {3727#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} is VALID [2018-11-14 17:24:15,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {3727#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} assume true; {3727#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} is VALID [2018-11-14 17:24:15,240 INFO L273 TraceCheckUtils]: 29: Hoare triple {3727#(or (not (= 0 main_~inner~0.offset)) (not (= 0 main_~inner~0.base)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {3726#false} is VALID [2018-11-14 17:24:15,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {3726#false} assume !false; {3726#false} is VALID [2018-11-14 17:24:15,242 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:24:15,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:15,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:24:15,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 17:24:15,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:15,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:24:15,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:15,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:24:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:24:15,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:15,303 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 3 states. [2018-11-14 17:24:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:15,465 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-14 17:24:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:24:15,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 17:24:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 17:24:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 17:24:15,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-14 17:24:15,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:15,729 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:24:15,729 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 17:24:15,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 17:24:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-14 17:24:15,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:15,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-14 17:24:15,765 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-14 17:24:15,765 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-14 17:24:15,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:15,769 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 17:24:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 17:24:15,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:15,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:15,769 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-14 17:24:15,770 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-14 17:24:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:15,772 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 17:24:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 17:24:15,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:15,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:15,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:15,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-14 17:24:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-11-14 17:24:15,776 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 31 [2018-11-14 17:24:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:15,777 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-14 17:24:15,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:24:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 17:24:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:24:15,777 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:15,778 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] [2018-11-14 17:24:15,778 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:15,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:15,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1322889158, now seen corresponding path program 1 times [2018-11-14 17:24:15,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:15,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:15,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:15,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:15,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:15,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {4118#true} call ULTIMATE.init(); {4118#true} is VALID [2018-11-14 17:24:15,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {4118#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4118#true} is VALID [2018-11-14 17:24:15,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4118#true} {4118#true} #355#return; {4118#true} is VALID [2018-11-14 17:24:15,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {4118#true} call #t~ret28 := main(); {4118#true} is VALID [2018-11-14 17:24:15,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {4118#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {4118#true} is VALID [2018-11-14 17:24:15,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {4118#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4118#true} is VALID [2018-11-14 17:24:15,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {4118#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4118#true} is VALID [2018-11-14 17:24:15,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {4118#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {4118#true} is VALID [2018-11-14 17:24:15,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {4118#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4118#true} is VALID [2018-11-14 17:24:15,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {4118#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4118#true} is VALID [2018-11-14 17:24:15,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {4118#true} assume !!#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {4118#true} is VALID [2018-11-14 17:24:15,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {4118#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4118#true} is VALID [2018-11-14 17:24:15,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {4118#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4118#true} is VALID [2018-11-14 17:24:15,854 INFO L273 TraceCheckUtils]: 18: Hoare triple {4118#true} assume !!(#t~nondet8 != 0);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, #t~mem10.offset + 4, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4); {4118#true} is VALID [2018-11-14 17:24:15,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {4118#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4118#true} is VALID [2018-11-14 17:24:15,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,855 INFO L273 TraceCheckUtils]: 23: Hoare triple {4118#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {4118#true} is VALID [2018-11-14 17:24:15,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {4118#true} assume true; {4118#true} is VALID [2018-11-14 17:24:15,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {4118#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {4118#true} is VALID [2018-11-14 17:24:15,856 INFO L273 TraceCheckUtils]: 26: Hoare triple {4118#true} assume #t~nondet12 != 0;havoc #t~nondet12;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 8, 4); {4118#true} is VALID [2018-11-14 17:24:15,856 INFO L273 TraceCheckUtils]: 27: Hoare triple {4118#true} assume true;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);#t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {4118#true} is VALID [2018-11-14 17:24:15,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {4118#true} assume #t~short18; {4120#|main_#t~short18|} is VALID [2018-11-14 17:24:15,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {4120#|main_#t~short18|} assume !#t~short18;havoc #t~mem17.base, #t~mem17.offset;havoc #t~short18;havoc #t~mem16.base, #t~mem16.offset; {4119#false} is VALID [2018-11-14 17:24:15,881 INFO L273 TraceCheckUtils]: 30: Hoare triple {4119#false} assume !false; {4119#false} is VALID [2018-11-14 17:24:15,882 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:24:15,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:15,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:24:15,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 17:24:15,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:15,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:24:15,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:15,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:24:15,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:24:15,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:15,947 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 3 states. [2018-11-14 17:24:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:16,117 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-11-14 17:24:16,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:24:16,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 17:24:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 17:24:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:24:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-14 17:24:16,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-14 17:24:16,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:16,199 INFO L225 Difference]: With dead ends: 94 [2018-11-14 17:24:16,199 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 17:24:16,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:24:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 17:24:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-14 17:24:16,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:16,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-14 17:24:16,227 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 17:24:16,227 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 17:24:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:16,232 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-14 17:24:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-14 17:24:16,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:16,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:16,232 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 17:24:16,232 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 17:24:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:16,235 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-14 17:24:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-14 17:24:16,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:16,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:16,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:16,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:24:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-14 17:24:16,239 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 31 [2018-11-14 17:24:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:16,239 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-14 17:24:16,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:24:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-14 17:24:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:24:16,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:16,240 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] [2018-11-14 17:24:16,241 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:16,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1322887236, now seen corresponding path program 1 times [2018-11-14 17:24:16,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:16,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:16,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:16,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:16,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:16,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {4515#true} call ULTIMATE.init(); {4515#true} is VALID [2018-11-14 17:24:16,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {4515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4515#true} is VALID [2018-11-14 17:24:16,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4515#true} {4515#true} #355#return; {4515#true} is VALID [2018-11-14 17:24:16,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {4515#true} call #t~ret28 := main(); {4515#true} is VALID [2018-11-14 17:24:16,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {4515#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {4515#true} is VALID [2018-11-14 17:24:16,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {4515#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4515#true} is VALID [2018-11-14 17:24:16,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {4515#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4515#true} is VALID [2018-11-14 17:24:16,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {4515#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {4515#true} is VALID [2018-11-14 17:24:16,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {4515#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4515#true} is VALID [2018-11-14 17:24:16,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {4515#true} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4515#true} is VALID [2018-11-14 17:24:16,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {4515#true} assume !!#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {4515#true} is VALID [2018-11-14 17:24:16,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {4515#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4515#true} is VALID [2018-11-14 17:24:16,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {4515#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4515#true} is VALID [2018-11-14 17:24:16,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {4515#true} assume !!(#t~nondet8 != 0);havoc #t~nondet8;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset + 0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem10.base, #t~mem10.offset + 4, 4);havoc #t~mem10.base, #t~mem10.offset;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 0, 4);~end~0.base, ~end~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 0, 4); {4515#true} is VALID [2018-11-14 17:24:16,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {4515#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4515#true} is VALID [2018-11-14 17:24:16,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {4515#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {4515#true} is VALID [2018-11-14 17:24:16,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {4515#true} assume true; {4515#true} is VALID [2018-11-14 17:24:16,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {4515#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {4515#true} is VALID [2018-11-14 17:24:16,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {4515#true} assume #t~nondet12 != 0;havoc #t~nondet12;call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset + 8, 4); {4515#true} is VALID [2018-11-14 17:24:16,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {4515#true} assume true;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);#t~short18 := #t~mem16.base != 0 || #t~mem16.offset != 0; {4517#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))))} is VALID [2018-11-14 17:24:16,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {4517#(or |main_#t~short18| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8)))))} assume !#t~short18;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);#t~short18 := #t~mem17.base == 0 && #t~mem17.offset == 0; {4518#|main_#t~short18|} is VALID [2018-11-14 17:24:16,394 INFO L273 TraceCheckUtils]: 29: Hoare triple {4518#|main_#t~short18|} assume !#t~short18;havoc #t~mem17.base, #t~mem17.offset;havoc #t~short18;havoc #t~mem16.base, #t~mem16.offset; {4516#false} is VALID [2018-11-14 17:24:16,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {4516#false} assume !false; {4516#false} is VALID [2018-11-14 17:24:16,395 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:24:16,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:16,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:24:16,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-14 17:24:16,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:16,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:24:16,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:16,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:24:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:24:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:16,431 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 4 states. [2018-11-14 17:24:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:16,684 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-14 17:24:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:24:16,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-14 17:24:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-14 17:24:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2018-11-14 17:24:16,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 92 transitions. [2018-11-14 17:24:16,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:16,818 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:24:16,819 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 17:24:16,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 17:24:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-14 17:24:16,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:16,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-14 17:24:16,847 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-14 17:24:16,847 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-14 17:24:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:16,850 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 17:24:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 17:24:16,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:16,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:16,851 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-14 17:24:16,851 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-14 17:24:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:16,854 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-14 17:24:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-14 17:24:16,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:16,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:16,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:16,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 17:24:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-14 17:24:16,857 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 31 [2018-11-14 17:24:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:16,857 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-14 17:24:16,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:24:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-14 17:24:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:24:16,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:16,859 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] [2018-11-14 17:24:16,859 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:16,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2145940021, now seen corresponding path program 1 times [2018-11-14 17:24:16,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:16,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:16,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:16,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:17,164 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-14 17:24:17,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {4907#true} call ULTIMATE.init(); {4907#true} is VALID [2018-11-14 17:24:17,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {4907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4907#true} is VALID [2018-11-14 17:24:17,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {4907#true} assume true; {4907#true} is VALID [2018-11-14 17:24:17,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4907#true} {4907#true} #355#return; {4907#true} is VALID [2018-11-14 17:24:17,359 INFO L256 TraceCheckUtils]: 4: Hoare triple {4907#true} call #t~ret28 := main(); {4907#true} is VALID [2018-11-14 17:24:17,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {4907#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 0, 4);call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 4, 4); {4907#true} is VALID [2018-11-14 17:24:17,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {4907#true} assume true; {4907#true} is VALID [2018-11-14 17:24:17,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {4907#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4907#true} is VALID [2018-11-14 17:24:17,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {4907#true} assume true; {4907#true} is VALID [2018-11-14 17:24:17,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {4907#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4907#true} is VALID [2018-11-14 17:24:17,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {4907#true} assume #t~nondet1 != 0;havoc #t~nondet1;call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset + 8, 4); {4907#true} is VALID [2018-11-14 17:24:17,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {4907#true} assume true;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4909#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))} is VALID [2018-11-14 17:24:17,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {4909#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8)))))} assume !#t~short7;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, ~list~0.offset + 8, 4);#t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 17:24:17,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !!#t~short7;havoc #t~short7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem5.base, #t~mem5.offset; {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 17:24:17,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume true; {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 17:24:17,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 17:24:17,365 INFO L273 TraceCheckUtils]: 16: Hoare triple {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume true; {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 17:24:17,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 17:24:17,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} assume !(#t~nondet8 != 0);havoc #t~nondet8; {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} is VALID [2018-11-14 17:24:17,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {4910#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 8))))} ~end~0.base, ~end~0.offset := 0, 0;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 17:24:17,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume true; {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 17:24:17,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 17:24:17,370 INFO L273 TraceCheckUtils]: 22: Hoare triple {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume true; {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 17:24:17,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume true; {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} is VALID [2018-11-14 17:24:17,373 INFO L273 TraceCheckUtils]: 24: Hoare triple {4911#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 8))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset);~len~0 := 0;call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~end~0.base, ~end~0.offset + 8, 4);~inner~0.base, ~inner~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset; {4912#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))} is VALID [2018-11-14 17:24:17,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {4912#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))} assume true; {4912#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))} is VALID [2018-11-14 17:24:17,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {4912#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {4908#false} is VALID [2018-11-14 17:24:17,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {4908#false} assume ~len~0 == 0;~len~0 := 1; {4908#false} is VALID [2018-11-14 17:24:17,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {4908#false} assume true; {4908#false} is VALID [2018-11-14 17:24:17,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {4908#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {4908#false} is VALID [2018-11-14 17:24:17,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {4908#false} assume true; {4908#false} is VALID [2018-11-14 17:24:17,381 INFO L273 TraceCheckUtils]: 31: Hoare triple {4908#false} assume true;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset + 8, 4); {4908#false} is VALID [2018-11-14 17:24:17,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {4908#false} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset);havoc #t~mem20.base, #t~mem20.offset; {4908#false} is VALID [2018-11-14 17:24:17,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {4908#false} assume !false; {4908#false} is VALID [2018-11-14 17:24:17,387 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:24:17,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:17,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:24:17,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-14 17:24:17,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:17,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:24:17,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:17,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:24:17,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:24:17,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:24:17,462 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 6 states. [2018-11-14 17:24:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:18,442 INFO L93 Difference]: Finished difference Result 215 states and 239 transitions. [2018-11-14 17:24:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:24:18,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-14 17:24:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:24:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2018-11-14 17:24:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:24:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions. [2018-11-14 17:24:18,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 221 transitions. [2018-11-14 17:24:18,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:18,709 INFO L225 Difference]: With dead ends: 215 [2018-11-14 17:24:18,709 INFO L226 Difference]: Without dead ends: 165 [2018-11-14 17:24:18,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:24:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-14 17:24:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 103. [2018-11-14 17:24:18,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:18,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 103 states. [2018-11-14 17:24:18,771 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 103 states. [2018-11-14 17:24:18,771 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 103 states. [2018-11-14 17:24:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:18,775 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2018-11-14 17:24:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2018-11-14 17:24:18,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:18,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:18,776 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 165 states. [2018-11-14 17:24:18,777 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 165 states. [2018-11-14 17:24:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:18,781 INFO L93 Difference]: Finished difference Result 165 states and 183 transitions. [2018-11-14 17:24:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2018-11-14 17:24:18,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:18,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:18,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:18,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 17:24:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-11-14 17:24:18,784 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 34 [2018-11-14 17:24:18,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:18,785 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-14 17:24:18,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:24:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-14 17:24:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:24:18,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:18,786 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] [2018-11-14 17:24:18,787 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:18,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:18,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1793071797, now seen corresponding path program 1 times [2018-11-14 17:24:18,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:18,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:18,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:18,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:18,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:19,235 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:24:19,241 INFO L168 Benchmark]: Toolchain (without parser) took 15548.36 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 860.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -326.5 MB). Peak memory consumption was 534.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:19,242 INFO L168 Benchmark]: CDTParser took 0.19 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:24:19,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.24 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:19,243 INFO L168 Benchmark]: Boogie Preprocessor took 189.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:19,244 INFO L168 Benchmark]: RCFGBuilder took 2023.48 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: 76.0 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:19,244 INFO L168 Benchmark]: TraceAbstraction took 12699.76 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 138.4 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 363.5 MB). Peak memory consumption was 501.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:19,249 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.19 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 630.24 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 189.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2023.48 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: 76.0 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12699.76 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 138.4 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 363.5 MB). Peak memory consumption was 501.9 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...