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-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:24:20,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:24:20,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:24:20,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:24:20,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:24:20,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:24:20,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:24:20,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:24:20,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:24:20,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:24:20,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:24:20,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:24:20,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:24:20,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:24:20,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:24:20,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:24:20,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:24:20,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:24:20,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:24:20,054 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:24:20,055 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:24:20,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:24:20,064 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:24:20,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:24:20,065 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:24:20,066 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:24:20,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:24:20,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:24:20,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:24:20,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:24:20,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:24:20,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:24:20,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:24:20,075 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:24:20,076 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:24:20,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:24:20,078 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:20,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:24:20,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:24:20,095 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:24:20,095 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:24:20,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:24:20,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:24:20,098 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:24:20,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:24:20,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:24:20,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:24:20,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:24:20,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:24:20,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:24:20,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:24:20,101 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:24:20,101 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:24:20,101 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:24:20,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:24:20,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:24:20,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:24:20,102 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:24:20,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:24:20,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:24:20,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:24:20,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:24:20,103 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:24:20,103 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:24:20,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:24:20,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:24:20,104 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:24:20,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:24:20,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:24:20,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:24:20,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:24:20,173 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:24:20,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:20,222 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74d07ddf/a04e780b149a416ebf8a11c6948ce2f1/FLAG424df6a6d [2018-11-14 17:24:20,722 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:24:20,723 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:20,736 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74d07ddf/a04e780b149a416ebf8a11c6948ce2f1/FLAG424df6a6d [2018-11-14 17:24:20,750 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74d07ddf/a04e780b149a416ebf8a11c6948ce2f1 [2018-11-14 17:24:20,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:24:20,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:24:20,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:24:20,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:24:20,766 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:24:20,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:20" (1/1) ... [2018-11-14 17:24:20,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5d175c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:20, skipping insertion in model container [2018-11-14 17:24:20,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:24:20" (1/1) ... [2018-11-14 17:24:20,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:24:20,843 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:24:21,265 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:24:21,280 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:24:21,334 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:24:21,410 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:24:21,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:21 WrapperNode [2018-11-14 17:24:21,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:24:21,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:24:21,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:24:21,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:24:21,497 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:21" (1/1) ... [2018-11-14 17:24:21,497 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:21" (1/1) ... [2018-11-14 17:24:21,522 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:21" (1/1) ... [2018-11-14 17:24:21,522 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:21" (1/1) ... [2018-11-14 17:24:21,556 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:21" (1/1) ... [2018-11-14 17:24:21,575 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:21" (1/1) ... [2018-11-14 17:24:21,581 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:21" (1/1) ... [2018-11-14 17:24:21,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:24:21,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:24:21,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:24:21,599 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:24:21,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:21" (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:21,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:24:21,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:24:21,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:24:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:24:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:24:21,654 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:24:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:24:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:24:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:24:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:24:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:24:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:24:21,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:24:21,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:24:21,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:24:21,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:24:21,656 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:24:21,656 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:24:21,657 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:24:21,657 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:24:21,657 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:24:21,657 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:24:21,657 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:24:21,657 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:24:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:24:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:24:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:24:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:24:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:24:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:24:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:24:21,659 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:24:21,659 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:24:21,659 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:24:21,659 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:24:21,659 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:24:21,659 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:24:21,659 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:24:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:24:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:24:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:24:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:24:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:24:21,660 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:24:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:24:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:24:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:24:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:24:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:24:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:24:21,661 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:24:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:24:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:24:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:24:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:24:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:24:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:24:21,662 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:24:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:24:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:24:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:24:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:24:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:24:21,663 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:24:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:24:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:24:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:24:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:24:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:24:21,664 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:24:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:24:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:24:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:24:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:24:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:24:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:24:21,665 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:24:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:24:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:24:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:24:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:24:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:24:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:24:21,666 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:24:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:24:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:24:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:24:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:24:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:24:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:24:21,667 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:24:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:24:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:24:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:24:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:24:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:24:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:24:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:24:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:24:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:24:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:24:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:24:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:24:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:24:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:24:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:24:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:24:21,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:24:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:24:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:24:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:24:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:24:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:24:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:24:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:24:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:24:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:24:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:24:22,727 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:24:22,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:22 BoogieIcfgContainer [2018-11-14 17:24:22,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:24:22,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:24:22,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:24:22,732 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:24:22,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:24:20" (1/3) ... [2018-11-14 17:24:22,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51390fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:22, skipping insertion in model container [2018-11-14 17:24:22,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:24:21" (2/3) ... [2018-11-14 17:24:22,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51390fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:24:22, skipping insertion in model container [2018-11-14 17:24:22,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:24:22" (3/3) ... [2018-11-14 17:24:22,736 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-11-14 17:24:22,746 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:24:22,754 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-14 17:24:22,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-14 17:24:22,803 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:24:22,804 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:24:22,804 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:24:22,804 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:24:22,805 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:24:22,805 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:24:22,805 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:24:22,805 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:24:22,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:24:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 17:24:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:24:22,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:22,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:22,834 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:22,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1593703150, now seen corresponding path program 1 times [2018-11-14 17:24:22,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:22,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:22,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:22,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:23,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 17:24:23,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-14 17:24:23,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 17:24:23,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #172#return; {57#true} is VALID [2018-11-14 17:24:23,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret18 := main(); {57#true} is VALID [2018-11-14 17:24:23,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 4, 4);call write~int(0, ~head~0.base, ~head~0.offset + 8, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {57#true} is VALID [2018-11-14 17:24:23,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-14 17:24:23,035 INFO L273 TraceCheckUtils]: 7: Hoare triple {58#false} call write~int(1, ~x~0.base, ~x~0.offset + 8, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, #t~mem6.offset + 4, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem7.base, #t~mem7.offset + 8, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {58#false} is VALID [2018-11-14 17:24:23,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 17:24:23,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {58#false} is VALID [2018-11-14 17:24:23,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 17:24:23,039 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:23,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:23,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:24:23,047 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:24:23,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:23,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:24:23,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:23,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:24:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:24:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:24:23,187 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-14 17:24:23,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:23,370 INFO L93 Difference]: Finished difference Result 102 states and 148 transitions. [2018-11-14 17:24:23,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:24:23,370 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 17:24:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:24:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2018-11-14 17:24:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:24:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2018-11-14 17:24:23,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 148 transitions. [2018-11-14 17:24:24,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:24,026 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:24:24,026 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:24:24,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:24:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:24:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-14 17:24:24,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:24,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:24,146 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:24,147 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:24,155 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 17:24:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 17:24:24,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:24,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:24,157 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:24,158 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 17:24:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:24,163 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 17:24:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 17:24:24,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:24,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:24,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:24,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:24:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-14 17:24:24,170 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-11-14 17:24:24,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:24,170 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-14 17:24:24,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:24:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 17:24:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:24:24,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:24,172 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:24,172 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:24,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1276921565, now seen corresponding path program 1 times [2018-11-14 17:24:24,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:24,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:24,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID [2018-11-14 17:24:24,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {333#true} is VALID [2018-11-14 17:24:24,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-14 17:24:24,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {333#true} {333#true} #172#return; {333#true} is VALID [2018-11-14 17:24:24,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {333#true} call #t~ret18 := main(); {333#true} is VALID [2018-11-14 17:24:24,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 4, 4);call write~int(0, ~head~0.base, ~head~0.offset + 8, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {335#(= (select |#valid| main_~x~0.base) 1)} is VALID [2018-11-14 17:24:24,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {335#(= (select |#valid| main_~x~0.base) 1)} assume true; {335#(= (select |#valid| main_~x~0.base) 1)} is VALID [2018-11-14 17:24:24,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {335#(= (select |#valid| main_~x~0.base) 1)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {335#(= (select |#valid| main_~x~0.base) 1)} is VALID [2018-11-14 17:24:24,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {335#(= (select |#valid| main_~x~0.base) 1)} assume !!(#t~nondet1 != 0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, #t~mem3.offset + 4, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~int(0, ~x~0.base, ~x~0.offset + 8, 4); {336#(not (= main_~x~0.base 0))} is VALID [2018-11-14 17:24:24,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {336#(not (= main_~x~0.base 0))} assume true; {336#(not (= main_~x~0.base 0))} is VALID [2018-11-14 17:24:24,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {336#(not (= main_~x~0.base 0))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {334#false} is VALID [2018-11-14 17:24:24,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {334#false} assume !false; {334#false} is VALID [2018-11-14 17:24:24,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:24,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:24,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:24:24,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 17:24:24,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:24,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:24:24,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:24,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:24:24,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:24:24,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:24,433 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 4 states. [2018-11-14 17:24:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:24,800 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 17:24:24,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:24:24,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 17:24:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:24:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:24:24,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 17:24:24,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:24,899 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:24:24,899 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 17:24:24,900 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:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 17:24:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 17:24:24,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:24,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:24,919 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:24,920 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:24,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:24,923 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-14 17:24:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 17:24:24,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:24,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:24,925 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:24,925 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 17:24:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:24,928 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-14 17:24:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 17:24:24,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:24,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:24,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:24,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:24:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-14 17:24:24,932 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 12 [2018-11-14 17:24:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:24,933 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-14 17:24:24,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:24:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 17:24:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:24:24,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:24,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:24,934 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:24,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:24,935 INFO L82 PathProgramCache]: Analyzing trace with hash 928632568, now seen corresponding path program 1 times [2018-11-14 17:24:24,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:24,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:24,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:24,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:24,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:25,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {547#true} call ULTIMATE.init(); {547#true} is VALID [2018-11-14 17:24:25,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {547#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {547#true} is VALID [2018-11-14 17:24:25,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {547#true} assume true; {547#true} is VALID [2018-11-14 17:24:25,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} #172#return; {547#true} is VALID [2018-11-14 17:24:25,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {547#true} call #t~ret18 := main(); {547#true} is VALID [2018-11-14 17:24:25,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {547#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 4, 4);call write~int(0, ~head~0.base, ~head~0.offset + 8, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {549#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 17:24:25,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {549#(not (= 0 main_~head~0.base))} assume true; {549#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 17:24:25,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {549#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {549#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 17:24:25,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {549#(not (= 0 main_~head~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {549#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 17:24:25,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {549#(not (= 0 main_~head~0.base))} call write~int(1, ~x~0.base, ~x~0.offset + 8, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, #t~mem6.offset + 4, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem7.base, #t~mem7.offset + 8, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {550#(not (= 0 main_~x~0.base))} is VALID [2018-11-14 17:24:25,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {550#(not (= 0 main_~x~0.base))} assume true; {550#(not (= 0 main_~x~0.base))} is VALID [2018-11-14 17:24:25,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {550#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {548#false} is VALID [2018-11-14 17:24:25,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {548#false} assume !false; {548#false} is VALID [2018-11-14 17:24:25,074 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:25,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:25,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:24:25,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 17:24:25,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:25,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:24:25,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:25,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:24:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:24:25,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:24:25,103 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 4 states. [2018-11-14 17:24:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:25,369 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 17:24:25,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:24:25,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 17:24:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 17:24:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:24:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 17:24:25,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-14 17:24:25,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:25,537 INFO L225 Difference]: With dead ends: 75 [2018-11-14 17:24:25,538 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 17:24:25,538 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:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 17:24:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-11-14 17:24:25,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:25,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 44 states. [2018-11-14 17:24:25,577 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 44 states. [2018-11-14 17:24:25,577 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 44 states. [2018-11-14 17:24:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:25,581 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-14 17:24:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-14 17:24:25,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:25,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:25,582 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 73 states. [2018-11-14 17:24:25,582 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 73 states. [2018-11-14 17:24:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:25,586 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-14 17:24:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-14 17:24:25,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:25,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:25,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:25,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:24:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-14 17:24:25,590 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 13 [2018-11-14 17:24:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:25,591 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-14 17:24:25,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:24:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-14 17:24:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:24:25,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:25,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:25,592 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:25,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1895008549, now seen corresponding path program 1 times [2018-11-14 17:24:25,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:25,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:25,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:25,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:25,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2018-11-14 17:24:25,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {843#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {843#true} is VALID [2018-11-14 17:24:25,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2018-11-14 17:24:25,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #172#return; {843#true} is VALID [2018-11-14 17:24:25,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret18 := main(); {843#true} is VALID [2018-11-14 17:24:25,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {843#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 4, 4);call write~int(0, ~head~0.base, ~head~0.offset + 8, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {843#true} is VALID [2018-11-14 17:24:25,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {843#true} assume true; {843#true} is VALID [2018-11-14 17:24:25,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {843#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {843#true} is VALID [2018-11-14 17:24:25,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {843#true} assume !(#t~nondet1 != 0);havoc #t~nondet1; {843#true} is VALID [2018-11-14 17:24:25,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {843#true} call write~int(1, ~x~0.base, ~x~0.offset + 8, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, #t~mem6.offset + 4, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem7.base, #t~mem7.offset + 8, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {843#true} is VALID [2018-11-14 17:24:25,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {843#true} assume true; {843#true} is VALID [2018-11-14 17:24:25,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {843#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {843#true} is VALID [2018-11-14 17:24:25,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {843#true} assume true; {843#true} is VALID [2018-11-14 17:24:25,708 INFO L273 TraceCheckUtils]: 13: Hoare triple {843#true} assume true; {843#true} is VALID [2018-11-14 17:24:25,709 INFO L273 TraceCheckUtils]: 14: Hoare triple {843#true} call #t~mem8 := read~int(~x~0.base, ~x~0.offset + 8, 4); {845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} is VALID [2018-11-14 17:24:25,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {845#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} assume !(1 != #t~mem8);havoc #t~mem8; {846#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2018-11-14 17:24:25,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {846#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume true;call #t~mem11 := read~int(~x~0.base, ~x~0.offset + 8, 4); {847#(= 1 |main_#t~mem11|)} is VALID [2018-11-14 17:24:25,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {847#(= 1 |main_#t~mem11|)} assume !(1 == #t~mem11);havoc #t~mem11; {844#false} is VALID [2018-11-14 17:24:25,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {844#false} assume !false; {844#false} is VALID [2018-11-14 17:24:25,723 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:25,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:25,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:24:25,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 17:24:25,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:25,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:24:25,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:25,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:24:25,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:24:25,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:24:25,771 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 5 states. [2018-11-14 17:24:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:26,064 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-14 17:24:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:24:26,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 17:24:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 17:24:26,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 17:24:26,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-14 17:24:26,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:26,144 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:24:26,145 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:24:26,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:24:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:24:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 17:24:26,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:26,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 17:24:26,172 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:24:26,172 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:24:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:26,174 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-14 17:24:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 17:24:26,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:26,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:26,176 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:24:26,176 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:24:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:26,178 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-14 17:24:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 17:24:26,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:26,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:26,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:26,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:24:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-14 17:24:26,182 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 19 [2018-11-14 17:24:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:26,183 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-14 17:24:26,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:24:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 17:24:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:24:26,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:26,184 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:24:26,184 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:26,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1894971806, now seen corresponding path program 1 times [2018-11-14 17:24:26,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:26,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:26,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:26,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:26,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2018-11-14 17:24:26,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1042#true} is VALID [2018-11-14 17:24:26,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2018-11-14 17:24:26,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #172#return; {1042#true} is VALID [2018-11-14 17:24:26,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret18 := main(); {1042#true} is VALID [2018-11-14 17:24:26,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {1042#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 4, 4);call write~int(0, ~head~0.base, ~head~0.offset + 8, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1044#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-14 17:24:26,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {1044#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} assume true; {1044#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-14 17:24:26,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {1044#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1044#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-14 17:24:26,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {1044#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {1044#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-14 17:24:26,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {1044#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} call write~int(1, ~x~0.base, ~x~0.offset + 8, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, #t~mem6.offset + 4, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem7.base, #t~mem7.offset + 8, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2018-11-14 17:24:26,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume true; {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2018-11-14 17:24:26,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2018-11-14 17:24:26,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume true; {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2018-11-14 17:24:26,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume true; {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2018-11-14 17:24:26,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {1045#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} call #t~mem8 := read~int(~x~0.base, ~x~0.offset + 8, 4); {1046#(= |main_#t~mem8| 1)} is VALID [2018-11-14 17:24:26,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {1046#(= |main_#t~mem8| 1)} assume !!(1 != #t~mem8);havoc #t~mem8; {1043#false} is VALID [2018-11-14 17:24:26,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {1043#false} assume true;call #t~mem9 := read~int(~x~0.base, ~x~0.offset + 8, 4); {1043#false} is VALID [2018-11-14 17:24:26,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {1043#false} assume !(0 == #t~mem9);havoc #t~mem9; {1043#false} is VALID [2018-11-14 17:24:26,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2018-11-14 17:24:26,531 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:26,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:24:26,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:24:26,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 17:24:26,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:24:26,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:24:26,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:26,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:24:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:24:26,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:24:26,557 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 5 states. [2018-11-14 17:24:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:26,910 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-14 17:24:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:24:26,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 17:24:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:24:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2018-11-14 17:24:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:24:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2018-11-14 17:24:26,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2018-11-14 17:24:27,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:24:27,061 INFO L225 Difference]: With dead ends: 82 [2018-11-14 17:24:27,061 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 17:24:27,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:24:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 17:24:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-14 17:24:27,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:24:27,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 52 states. [2018-11-14 17:24:27,100 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 52 states. [2018-11-14 17:24:27,100 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 52 states. [2018-11-14 17:24:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:27,102 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-14 17:24:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 17:24:27,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:27,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:27,103 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 56 states. [2018-11-14 17:24:27,103 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 56 states. [2018-11-14 17:24:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:24:27,106 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-14 17:24:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 17:24:27,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:24:27,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:24:27,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:24:27,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:24:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:24:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-14 17:24:27,111 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 19 [2018-11-14 17:24:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:24:27,111 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-14 17:24:27,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:24:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-14 17:24:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:24:27,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:24:27,113 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:27,113 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:24:27,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:24:27,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1151742973, now seen corresponding path program 1 times [2018-11-14 17:24:27,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:24:27,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:24:27,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:27,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:24:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:24:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:24:27,399 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:27,404 INFO L168 Benchmark]: Toolchain (without parser) took 6644.19 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -403.3 MB). Peak memory consumption was 351.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:27,406 INFO L168 Benchmark]: CDTParser took 0.24 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:27,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.58 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:27,408 INFO L168 Benchmark]: Boogie Preprocessor took 186.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:27,409 INFO L168 Benchmark]: RCFGBuilder took 1129.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:27,409 INFO L168 Benchmark]: TraceAbstraction took 4673.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 331.8 MB). Peak memory consumption was 331.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:24:27,414 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.24 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 649.58 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 186.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -822.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1129.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4673.72 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 331.8 MB). Peak memory consumption was 331.8 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...