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_Bitvector.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:25:20,031 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:25:20,033 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:25:20,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:25:20,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:25:20,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:25:20,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:25:20,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:25:20,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:25:20,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:25:20,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:25:20,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:25:20,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:25:20,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:25:20,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:25:20,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:25:20,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:25:20,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:25:20,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:25:20,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:25:20,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:25:20,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:25:20,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:25:20,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:25:20,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:25:20,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:25:20,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:25:20,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:25:20,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:25:20,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:25:20,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:25:20,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:25:20,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:25:20,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:25:20,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:25:20,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:25:20,082 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:25:20,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:25:20,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:25:20,099 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:25:20,099 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:25:20,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:25:20,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:25:20,100 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:25:20,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:25:20,100 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:25:20,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:25:20,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:25:20,101 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:25:20,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:25:20,101 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:25:20,101 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:25:20,102 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:25:20,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:25:20,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:25:20,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:25:20,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:25:20,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:25:20,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:25:20,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:25:20,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:25:20,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:25:20,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:25:20,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:25:20,104 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:25:20,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:25:20,104 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:25:20,105 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:25:20,105 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:25:20,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:25:20,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:25:20,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:25:20,167 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:25:20,168 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:25:20,169 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-14 16:25:20,239 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9cff00eb/4bc3bf263459436fb9c15131faa84449/FLAG740d2e164 [2018-11-14 16:25:20,803 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:25:20,804 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-14 16:25:20,817 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9cff00eb/4bc3bf263459436fb9c15131faa84449/FLAG740d2e164 [2018-11-14 16:25:20,833 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9cff00eb/4bc3bf263459436fb9c15131faa84449 [2018-11-14 16:25:20,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:25:20,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:25:20,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:25:20,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:25:20,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:25:20,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:25:20" (1/1) ... [2018-11-14 16:25:20,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f8346e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:20, skipping insertion in model container [2018-11-14 16:25:20,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:25:20" (1/1) ... [2018-11-14 16:25:20,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:25:20,918 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:25:21,348 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:25:21,370 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:25:21,452 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:25:21,609 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:25:21,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21 WrapperNode [2018-11-14 16:25:21,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:25:21,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:25:21,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:25:21,611 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:25:21,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21" (1/1) ... [2018-11-14 16:25:21,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21" (1/1) ... [2018-11-14 16:25:21,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21" (1/1) ... [2018-11-14 16:25:21,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21" (1/1) ... [2018-11-14 16:25:21,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21" (1/1) ... [2018-11-14 16:25:21,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21" (1/1) ... [2018-11-14 16:25:21,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21" (1/1) ... [2018-11-14 16:25:21,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:25:21,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:25:21,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:25:21,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:25:21,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25: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 16:25:21,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:25:21,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:25:21,795 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:25:21,795 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:25:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:25:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:25:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:25:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:25:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:25:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:25:21,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:25:21,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:25:21,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:25:21,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:25:21,797 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:25:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:25:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:25:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:25:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:25:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:25:21,798 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:25:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:25:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:25:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:25:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:25:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:25:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:25:21,799 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:25:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:25:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:25:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:25:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:25:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:25:21,800 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:25:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:25:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:25:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:25:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:25:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:25:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:25:21,801 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:25:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:25:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:25:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:25:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:25:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:25:21,802 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:25:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:25:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:25:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:25:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:25:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:25:21,803 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:25:21,804 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:25:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:25:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:25:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:25:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:25:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:25:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:25:21,805 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:25:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:25:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:25:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:25:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:25:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:25:21,806 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:25:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:25:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:25:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:25:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:25:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:25:21,807 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:25:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:25:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:25:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:25:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:25:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:25:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:25:21,808 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:25:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:25:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:25:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:25:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:25:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:25:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:25:21,809 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:25:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:25:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:25:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:25:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:25:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:25:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:25:21,810 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:25:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:25:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:25:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:25:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:25:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:25:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:25:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:25:21,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:25:21,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:25:21,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:25:21,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:25:21,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:25:21,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:25:21,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:25:21,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:25:21,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:25:21,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:25:21,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:25:23,530 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:25:23,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:25:23 BoogieIcfgContainer [2018-11-14 16:25:23,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:25:23,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:25:23,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:25:23,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:25:23,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:25:20" (1/3) ... [2018-11-14 16:25:23,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e31311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:25:23, skipping insertion in model container [2018-11-14 16:25:23,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:25:21" (2/3) ... [2018-11-14 16:25:23,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e31311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:25:23, skipping insertion in model container [2018-11-14 16:25:23,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:25:23" (3/3) ... [2018-11-14 16:25:23,538 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-11-14 16:25:23,548 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:25:23,557 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-11-14 16:25:23,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-11-14 16:25:23,608 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:25:23,609 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:25:23,609 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:25:23,609 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:25:23,609 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:25:23,610 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:25:23,610 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:25:23,610 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:25:23,610 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:25:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-14 16:25:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:25:23,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:23,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:23,656 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:23,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:23,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1139058233, now seen corresponding path program 1 times [2018-11-14 16:25:23,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:23,669 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:23,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:23,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:23,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-14 16:25:23,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {60#true} is VALID [2018-11-14 16:25:23,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-14 16:25:23,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #201#return; {60#true} is VALID [2018-11-14 16:25:23,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret21 := main(); {60#true} is VALID [2018-11-14 16:25:23,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {60#true} is VALID [2018-11-14 16:25:23,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {60#true} assume !true; {61#false} is VALID [2018-11-14 16:25:23,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#false} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {61#false} is VALID [2018-11-14 16:25:23,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#false} assume true; {61#false} is VALID [2018-11-14 16:25:23,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {61#false} is VALID [2018-11-14 16:25:23,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-14 16:25:23,826 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 16:25:23,826 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:25:23,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:25:23,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:25:23,836 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:25:23,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:23,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:25:23,888 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 16:25:23,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:25:23,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:25:23,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:25:23,899 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-11-14 16:25:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:26,206 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2018-11-14 16:25:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:25:26,206 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 16:25:26,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:25:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-14 16:25:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:25:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2018-11-14 16:25:26,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 166 transitions. [2018-11-14 16:25:26,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:26,971 INFO L225 Difference]: With dead ends: 108 [2018-11-14 16:25:26,971 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 16:25:26,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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 16:25:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 16:25:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-14 16:25:27,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:27,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-14 16:25:27,029 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 16:25:27,029 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 16:25:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:27,035 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-14 16:25:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-14 16:25:27,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:27,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:27,036 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 16:25:27,036 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 16:25:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:27,042 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-14 16:25:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-14 16:25:27,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:27,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:27,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:27,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:27,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 16:25:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-11-14 16:25:27,049 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-11-14 16:25:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:27,049 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-11-14 16:25:27,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:25:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-14 16:25:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:25:27,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:27,051 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:27,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:27,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1145447806, now seen corresponding path program 1 times [2018-11-14 16:25:27,052 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:27,052 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:27,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:27,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:27,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 16:25:27,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:27,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:27,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-14 16:25:27,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-14 16:25:27,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {366#true} is VALID [2018-11-14 16:25:27,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-14 16:25:27,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #201#return; {366#true} is VALID [2018-11-14 16:25:27,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret21 := main(); {366#true} is VALID [2018-11-14 16:25:27,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {386#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-14 16:25:27,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {386#(not (= main_~list~0.base main_~null~0.base))} assume true; {386#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-14 16:25:27,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#(not (= main_~list~0.base main_~null~0.base))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {386#(not (= main_~list~0.base main_~null~0.base))} is VALID [2018-11-14 16:25:27,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {386#(not (= main_~list~0.base main_~null~0.base))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {396#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 16:25:27,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {396#(not (= main_~end~0.base main_~null~0.base))} assume true; {396#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 16:25:27,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {396#(not (= main_~end~0.base main_~null~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {367#false} is VALID [2018-11-14 16:25:27,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-14 16:25:27,437 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 16:25:27,438 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:25:27,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:25:27,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:25:27,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:25:27,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:27,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:25:27,527 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 16:25:27,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:25:27,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:25:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:25:27,528 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 4 states. [2018-11-14 16:25:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:28,425 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-14 16:25:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:25:28,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:25:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:25:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-14 16:25:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:25:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2018-11-14 16:25:28,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2018-11-14 16:25:28,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:28,588 INFO L225 Difference]: With dead ends: 56 [2018-11-14 16:25:28,589 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 16:25:28,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 16:25:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 16:25:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-14 16:25:28,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:28,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 47 states. [2018-11-14 16:25:28,625 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 47 states. [2018-11-14 16:25:28,625 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 47 states. [2018-11-14 16:25:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:28,629 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-14 16:25:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-14 16:25:28,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:28,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:28,631 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states. [2018-11-14 16:25:28,631 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states. [2018-11-14 16:25:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:28,635 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-14 16:25:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-14 16:25:28,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:28,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:28,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:28,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 16:25:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-11-14 16:25:28,639 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 12 [2018-11-14 16:25:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:28,640 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-11-14 16:25:28,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:25:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-11-14 16:25:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:25:28,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:28,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:28,641 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:28,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1145509372, now seen corresponding path program 1 times [2018-11-14 16:25:28,643 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:28,643 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:28,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:28,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:28,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-14 16:25:28,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:25:28,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:29,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-14 16:25:29,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-14 16:25:29,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:29,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:25:29,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2018-11-14 16:25:29,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 16:25:29,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:25:29,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:25:29,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-14 16:25:29,381 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2018-11-14 16:25:29,405 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:29,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 16:25:29,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-14 16:25:29,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:29,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:29,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:29,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 16:25:29,482 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:29,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {633#true} call ULTIMATE.init(); {633#true} is VALID [2018-11-14 16:25:29,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {633#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {633#true} is VALID [2018-11-14 16:25:29,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {633#true} assume true; {633#true} is VALID [2018-11-14 16:25:29,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {633#true} {633#true} #201#return; {633#true} is VALID [2018-11-14 16:25:29,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {633#true} call #t~ret21 := main(); {633#true} is VALID [2018-11-14 16:25:29,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {633#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {633#true} is VALID [2018-11-14 16:25:29,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {633#true} assume true; {633#true} is VALID [2018-11-14 16:25:29,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {633#true} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, ~bvadd32(4bv32, #t~mem4.offset), 4bv32);havoc #t~mem4.base, #t~mem4.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {633#true} is VALID [2018-11-14 16:25:29,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {633#true} assume !(#t~nondet6 != 0bv32);havoc #t~nondet6;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, ~bvadd32(4bv32, #t~mem8.offset), 4bv32);havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {662#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 16:25:29,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {662#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true;call #t~mem10 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {666#(= ~unnamed1~0~BLACK |main_#t~mem10|)} is VALID [2018-11-14 16:25:29,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {666#(= ~unnamed1~0~BLACK |main_#t~mem10|)} assume !(~unnamed1~0~BLACK == #t~mem10);havoc #t~mem10; {634#false} is VALID [2018-11-14 16:25:29,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {634#false} assume !false; {634#false} is VALID [2018-11-14 16:25:29,498 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 16:25:29,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:25:29,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:25:29,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:25:29,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:25:29,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:29,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:25:29,534 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 16:25:29,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:25:29,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:25:29,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:25:29,535 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-11-14 16:25:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:30,285 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-11-14 16:25:30,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:25:30,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-14 16:25:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:25:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 16:25:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:25:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-14 16:25:30,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-14 16:25:30,371 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 16:25:30,373 INFO L225 Difference]: With dead ends: 47 [2018-11-14 16:25:30,374 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 16:25:30,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 16:25:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 16:25:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-14 16:25:30,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:30,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-14 16:25:30,401 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 16:25:30,401 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 16:25:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:30,403 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-14 16:25:30,404 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 16:25:30,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:30,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:30,405 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-14 16:25:30,405 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-14 16:25:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:30,408 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-14 16:25:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 16:25:30,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:30,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:30,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:30,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 16:25:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-14 16:25:30,412 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 12 [2018-11-14 16:25:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:30,412 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-14 16:25:30,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:25:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-14 16:25:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:25:30,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:30,413 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:30,414 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:30,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -516417822, now seen corresponding path program 1 times [2018-11-14 16:25:30,415 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:30,415 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:30,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:30,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:30,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-14 16:25:30,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:25:30,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:30,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-14 16:25:30,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-14 16:25:30,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:30,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:30,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:30,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:25:30,851 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-11-14 16:25:32,865 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:32,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:25:32,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:25:32,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:32,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:32,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:25:32,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 16:25:32,976 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:25:32,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2018-11-14 16:25:32,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {870#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {870#true} is VALID [2018-11-14 16:25:32,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2018-11-14 16:25:32,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #201#return; {870#true} is VALID [2018-11-14 16:25:32,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret21 := main(); {870#true} is VALID [2018-11-14 16:25:33,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {870#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {890#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:33,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {890#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume true; {890#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:33,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {890#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {890#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:33,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {890#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (_ bv0 32)))} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {900#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:33,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {900#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} assume true; {900#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:33,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {900#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {900#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:33,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} assume true; {900#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:25:33,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32)))) (= main_~end~0.offset (_ bv0 32)))} assume true;call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {913#(= ~unnamed1~0~BLACK |main_#t~mem12|)} is VALID [2018-11-14 16:25:33,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {913#(= ~unnamed1~0~BLACK |main_#t~mem12|)} assume !(~unnamed1~0~BLACK == #t~mem12);havoc #t~mem12; {871#false} is VALID [2018-11-14 16:25:33,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {871#false} assume !false; {871#false} is VALID [2018-11-14 16:25:33,027 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 16:25:33,028 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:25:33,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:25:33,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:25:33,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:25:33,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:25:33,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:25:33,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:33,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:25:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:25:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:25:33,117 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2018-11-14 16:25:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:35,058 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-11-14 16:25:35,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:25:35,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:25:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:25:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:25:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2018-11-14 16:25:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:25:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2018-11-14 16:25:35,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 99 transitions. [2018-11-14 16:25:35,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:25:35,240 INFO L225 Difference]: With dead ends: 91 [2018-11-14 16:25:35,240 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 16:25:35,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:25:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 16:25:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2018-11-14 16:25:35,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:25:35,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 63 states. [2018-11-14 16:25:35,326 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 63 states. [2018-11-14 16:25:35,327 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 63 states. [2018-11-14 16:25:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:35,333 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-14 16:25:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-11-14 16:25:35,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:35,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:35,335 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 89 states. [2018-11-14 16:25:35,335 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 89 states. [2018-11-14 16:25:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:25:35,340 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-14 16:25:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-11-14 16:25:35,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:25:35,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:25:35,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:25:35,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:25:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 16:25:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-14 16:25:35,346 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2018-11-14 16:25:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:25:35,346 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-14 16:25:35,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:25:35,347 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-14 16:25:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:25:35,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:25:35,348 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:25:35,348 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:25:35,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:25:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1944375202, now seen corresponding path program 1 times [2018-11-14 16:25:35,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:25:35,349 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:25:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:25:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:25:35,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:25:35,643 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-11-14 16:25:35,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-11-14 16:25:35,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:25:35,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:35,970 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-11-14 16:25:36,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2018-11-14 16:25:36,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-14 16:25:36,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:38,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-14 16:25:38,026 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 16:25:40,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-11-14 16:25:40,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-14 16:25:40,614 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:41,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:25:41,071 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-11-14 16:25:41,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 46 [2018-11-14 16:25:41,162 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-14 16:25:42,256 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:25:42,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 41 [2018-11-14 16:25:42,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2018-11-14 16:25:42,523 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-14 16:25:43,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-14 16:25:43,020 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:43,271 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:25:46,151 INFO L303 Elim1Store]: Index analysis took 352 ms [2018-11-14 16:25:46,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 55 [2018-11-14 16:25:46,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-14 16:25:46,345 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 16:25:47,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:25:47,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 46 [2018-11-14 16:25:47,654 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-11-14 16:25:51,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-14 16:25:51,029 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-14 16:25:54,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 47 [2018-11-14 16:25:54,659 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-14 16:25:57,447 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-14 16:25:59,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-14 16:25:59,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-14 16:26:00,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-11-14 16:26:00,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:26:00,415 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:00,605 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-11-14 16:26:00,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2018-11-14 16:26:00,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-14 16:26:00,782 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:01,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-14 16:26:01,136 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:01,734 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-11-14 16:26:01,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 56 [2018-11-14 16:26:01,947 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:26:02,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 43 [2018-11-14 16:26:02,176 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-11-14 16:26:03,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-14 16:26:03,006 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:03,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 44 [2018-11-14 16:26:03,691 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-11-14 16:26:04,154 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-11-14 16:26:05,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 55 [2018-11-14 16:26:05,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-11-14 16:26:05,823 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-14 16:26:06,335 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:26:06,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 43 [2018-11-14 16:26:06,432 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-11-14 16:26:07,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2018-11-14 16:26:07,118 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-14 16:26:07,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-14 16:26:07,466 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:07,742 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:26:08,000 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:26:08,175 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:26:08,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 17 xjuncts. [2018-11-14 16:26:08,962 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 6 variables, input treesize:130, output treesize:669 [2018-11-14 16:26:11,274 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:26:11,835 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 15 [2018-11-14 16:26:11,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:26:11,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:26:11,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:11,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:11,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:26:11,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:26:11,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:11,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:11,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:11,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:32, output treesize:10 [2018-11-14 16:26:11,992 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:26:12,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {1275#true} call ULTIMATE.init(); {1275#true} is VALID [2018-11-14 16:26:12,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {1275#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1275#true} is VALID [2018-11-14 16:26:12,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {1275#true} assume true; {1275#true} is VALID [2018-11-14 16:26:12,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1275#true} {1275#true} #201#return; {1275#true} is VALID [2018-11-14 16:26:12,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {1275#true} call #t~ret21 := main(); {1275#true} is VALID [2018-11-14 16:26:12,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {1275#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1295#(= (_ bv0 32) main_~null~0.offset)} is VALID [2018-11-14 16:26:12,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {1295#(= (_ bv0 32) main_~null~0.offset)} assume true; {1295#(= (_ bv0 32) main_~null~0.offset)} is VALID [2018-11-14 16:26:12,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {1295#(= (_ bv0 32) main_~null~0.offset)} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, ~bvadd32(4bv32, #t~mem4.offset), 4bv32);havoc #t~mem4.base, #t~mem4.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {1295#(= (_ bv0 32) main_~null~0.offset)} is VALID [2018-11-14 16:26:12,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {1295#(= (_ bv0 32) main_~null~0.offset)} assume !(#t~nondet6 != 0bv32);havoc #t~nondet6;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, ~bvadd32(4bv32, #t~mem8.offset), 4bv32);havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1305#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:26:12,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {1305#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem10 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1305#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:26:12,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {1305#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume !!(~unnamed1~0~BLACK == #t~mem10);havoc #t~mem10; {1305#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:26:12,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {1305#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true; {1305#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} is VALID [2018-11-14 16:26:12,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {1305#(and (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base) (= (_ bv0 32) main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))} assume true;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); {1318#(and (= |main_#t~mem11.offset| main_~null~0.offset) (= |main_#t~mem11.base| main_~null~0.base) (= (_ bv0 32) main_~null~0.offset))} is VALID [2018-11-14 16:26:12,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {1318#(and (= |main_#t~mem11.offset| main_~null~0.offset) (= |main_#t~mem11.base| main_~null~0.base) (= (_ bv0 32) main_~null~0.offset))} assume !(~null~0.base == #t~mem11.base && ~null~0.offset == #t~mem11.offset);havoc #t~mem11.base, #t~mem11.offset; {1276#false} is VALID [2018-11-14 16:26:12,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {1276#false} assume !false; {1276#false} is VALID [2018-11-14 16:26:12,034 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 16:26:12,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:26:12,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:26:12,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:26:12,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:26:12,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:26:12,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:26:12,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:26:12,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:26:12,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:26:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:26:12,090 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-11-14 16:26:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:13,886 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-14 16:26:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:26:13,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-14 16:26:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:26:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:26:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-14 16:26:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:26:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-14 16:26:13,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2018-11-14 16:26:13,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:26:13,971 INFO L225 Difference]: With dead ends: 63 [2018-11-14 16:26:13,971 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 16:26:13,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:26:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 16:26:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-14 16:26:14,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:26:14,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-14 16:26:14,003 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-14 16:26:14,003 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-14 16:26:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:14,006 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-11-14 16:26:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-14 16:26:14,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:14,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:14,007 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-14 16:26:14,007 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-14 16:26:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:14,010 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-11-14 16:26:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-14 16:26:14,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:14,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:14,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:26:14,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:26:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-14 16:26:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-11-14 16:26:14,013 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 15 [2018-11-14 16:26:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:26:14,014 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-14 16:26:14,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:26:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-14 16:26:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:26:14,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:26:14,015 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:26:14,015 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:26:14,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:26:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1338317065, now seen corresponding path program 1 times [2018-11-14 16:26:14,016 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:26:14,016 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:26:14,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:26:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:26:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:26:14,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:26:14,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:14,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-14 16:26:14,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-14 16:26:14,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2018-11-14 16:26:14,216 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:26:14,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:14,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:14,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:14,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-14 16:26:14,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-14 16:26:14,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:26:14,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:26:14,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:26:14,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:26:14,635 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:59, output treesize:29 [2018-11-14 16:26:14,649 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:26:14,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:14,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:14,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:14,794 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:26:14,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-14 16:26:14,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:14,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2018-11-14 16:26:15,111 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-14 16:26:15,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:26:15,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:15,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-14 16:26:15,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:26:15,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:15,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-14 16:26:15,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 16:26:15,408 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-14 16:26:15,495 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:26:15,572 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:26:15,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:26:15,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-14 16:26:15,910 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:132, output treesize:98 [2018-11-14 16:26:16,022 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:26:16,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2018-11-14 16:26:16,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:26:16,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:16,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-14 16:26:16,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:16,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:16,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:16,224 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:8 [2018-11-14 16:26:16,230 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:26:16,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {1590#true} call ULTIMATE.init(); {1590#true} is VALID [2018-11-14 16:26:16,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {1590#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1590#true} is VALID [2018-11-14 16:26:16,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {1590#true} assume true; {1590#true} is VALID [2018-11-14 16:26:16,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1590#true} {1590#true} #201#return; {1590#true} is VALID [2018-11-14 16:26:16,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {1590#true} call #t~ret21 := main(); {1590#true} is VALID [2018-11-14 16:26:16,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {1590#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1610#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (not (= main_~end~0.base main_~null~0.base)) (= (_ bv1 1) (select |#valid| main_~end~0.base)))} is VALID [2018-11-14 16:26:16,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {1610#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (not (= main_~end~0.base main_~null~0.base)) (= (_ bv1 1) (select |#valid| main_~end~0.base)))} assume true; {1610#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (not (= main_~end~0.base main_~null~0.base)) (= (_ bv1 1) (select |#valid| main_~end~0.base)))} is VALID [2018-11-14 16:26:16,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {1610#(and (= (_ bv1 1) (select |#valid| main_~null~0.base)) (not (= main_~end~0.base main_~null~0.base)) (= (_ bv1 1) (select |#valid| main_~end~0.base)))} assume !!(#t~nondet2 != 0bv32);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc3.base, #t~malloc3.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem4.base, ~bvadd32(4bv32, #t~mem4.offset), 4bv32);havoc #t~mem4.base, #t~mem4.offset;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32); {1617#(and (not (= main_~end~0.base main_~null~0.base)) (exists ((v_main_~end~0.base_29 (_ BitVec 32))) (and (= (bvadd (select |#valid| v_main_~end~0.base_29) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~end~0.base_29 main_~end~0.base)) (not (= v_main_~end~0.base_29 main_~null~0.base)))) (not (= (_ bv0 1) (select |#valid| main_~null~0.base))) (= (_ bv1 1) (select |#valid| main_~end~0.base)))} is VALID [2018-11-14 16:26:16,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {1617#(and (not (= main_~end~0.base main_~null~0.base)) (exists ((v_main_~end~0.base_29 (_ BitVec 32))) (and (= (bvadd (select |#valid| v_main_~end~0.base_29) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~end~0.base_29 main_~end~0.base)) (not (= v_main_~end~0.base_29 main_~null~0.base)))) (not (= (_ bv0 1) (select |#valid| main_~null~0.base))) (= (_ bv1 1) (select |#valid| main_~end~0.base)))} assume !(#t~nondet6 != 0bv32);havoc #t~nondet6;call write~intINTTYPE4(~unnamed1~0~RED, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32);call #t~malloc7.base, #t~malloc7.offset := #Ultimate.alloc(12bv32);call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~end~0.base, ~end~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);call write~$Pointer$(~end~0.base, ~end~0.offset, #t~mem8.base, ~bvadd32(4bv32, #t~mem8.offset), 4bv32);havoc #t~mem8.base, #t~mem8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~end~0.base, ~end~0.offset, 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1621#(exists ((v_main_~end~0.base_30 (_ BitVec 32)) (v_main_~end~0.offset_30 (_ BitVec 32))) (and (not (= v_main_~end~0.base_30 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~end~0.base) (not (= v_main_~end~0.base_30 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30)) main_~end~0.offset) main_~null~0.base)))} is VALID [2018-11-14 16:26:16,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {1621#(exists ((v_main_~end~0.base_30 (_ BitVec 32)) (v_main_~end~0.offset_30 (_ BitVec 32))) (and (not (= v_main_~end~0.base_30 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~end~0.base) (not (= v_main_~end~0.base_30 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30)) main_~end~0.offset) main_~null~0.base)))} assume true;call #t~mem10 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1621#(exists ((v_main_~end~0.base_30 (_ BitVec 32)) (v_main_~end~0.offset_30 (_ BitVec 32))) (and (not (= v_main_~end~0.base_30 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~end~0.base) (not (= v_main_~end~0.base_30 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30)) main_~end~0.offset) main_~null~0.base)))} is VALID [2018-11-14 16:26:16,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {1621#(exists ((v_main_~end~0.base_30 (_ BitVec 32)) (v_main_~end~0.offset_30 (_ BitVec 32))) (and (not (= v_main_~end~0.base_30 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~end~0.base) (not (= v_main_~end~0.base_30 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30)) main_~end~0.offset) main_~null~0.base)))} assume !!(~unnamed1~0~BLACK == #t~mem10);havoc #t~mem10; {1621#(exists ((v_main_~end~0.base_30 (_ BitVec 32)) (v_main_~end~0.offset_30 (_ BitVec 32))) (and (not (= v_main_~end~0.base_30 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~end~0.base) (not (= v_main_~end~0.base_30 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30)) main_~end~0.offset) main_~null~0.base)))} is VALID [2018-11-14 16:26:16,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {1621#(exists ((v_main_~end~0.base_30 (_ BitVec 32)) (v_main_~end~0.offset_30 (_ BitVec 32))) (and (not (= v_main_~end~0.base_30 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~end~0.base) (not (= v_main_~end~0.base_30 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30)) main_~end~0.offset) main_~null~0.base)))} assume true; {1621#(exists ((v_main_~end~0.base_30 (_ BitVec 32)) (v_main_~end~0.offset_30 (_ BitVec 32))) (and (not (= v_main_~end~0.base_30 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~end~0.base) (not (= v_main_~end~0.base_30 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30)) main_~end~0.offset) main_~null~0.base)))} is VALID [2018-11-14 16:26:16,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {1621#(exists ((v_main_~end~0.base_30 (_ BitVec 32)) (v_main_~end~0.offset_30 (_ BitVec 32))) (and (not (= v_main_~end~0.base_30 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30) main_~end~0.base) (not (= v_main_~end~0.base_30 (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~end~0.base_30) v_main_~end~0.offset_30)) main_~end~0.offset) main_~null~0.base)))} assume true;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32); {1634#(and (= |main_#t~mem11.base| main_~null~0.base) (not (= main_~end~0.base main_~null~0.base)))} is VALID [2018-11-14 16:26:16,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {1634#(and (= |main_#t~mem11.base| main_~null~0.base) (not (= main_~end~0.base main_~null~0.base)))} assume !!(~null~0.base == #t~mem11.base && ~null~0.offset == #t~mem11.offset);havoc #t~mem11.base, #t~mem11.offset; {1638#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 16:26:16,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {1638#(not (= main_~end~0.base main_~null~0.base))} assume true; {1638#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 16:26:16,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {1638#(not (= main_~end~0.base main_~null~0.base))} assume true; {1638#(not (= main_~end~0.base main_~null~0.base))} is VALID [2018-11-14 16:26:16,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {1638#(not (= main_~end~0.base main_~null~0.base))} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1591#false} is VALID [2018-11-14 16:26:16,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {1591#false} assume !false; {1591#false} is VALID [2018-11-14 16:26:16,473 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 16:26:16,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:26:16,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:26:16,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:26:16,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:26:16,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:26:16,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:26:16,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:26:16,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:26:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:26:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:26:16,763 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 7 states. [2018-11-14 16:26:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:21,486 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-14 16:26:21,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:26:21,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:26:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:26:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:26:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-14 16:26:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:26:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-14 16:26:21,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2018-11-14 16:26:22,069 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 16:26:22,070 INFO L225 Difference]: With dead ends: 64 [2018-11-14 16:26:22,071 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 16:26:22,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:26:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 16:26:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-11-14 16:26:22,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:26:22,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 59 states. [2018-11-14 16:26:22,287 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 59 states. [2018-11-14 16:26:22,287 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 59 states. [2018-11-14 16:26:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:22,289 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-14 16:26:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-14 16:26:22,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:22,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:22,290 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 62 states. [2018-11-14 16:26:22,290 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 62 states. [2018-11-14 16:26:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:22,293 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-14 16:26:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-14 16:26:22,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:22,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:22,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:26:22,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:26:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:26:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-11-14 16:26:22,296 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 18 [2018-11-14 16:26:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:26:22,296 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-11-14 16:26:22,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:26:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-11-14 16:26:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:26:22,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:26:22,297 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] [2018-11-14 16:26:22,297 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:26:22,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:26:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2064999472, now seen corresponding path program 1 times [2018-11-14 16:26:22,298 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:26:22,298 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:26:22,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:26:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:26:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:26:22,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:26:22,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 16:26:22,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-14 16:26:22,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:22,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:22,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:26:22,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 16:26:22,679 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:26:22,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {1920#true} call ULTIMATE.init(); {1920#true} is VALID [2018-11-14 16:26:22,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {1920#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1920#true} is VALID [2018-11-14 16:26:22,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {1920#true} assume true; {1920#true} is VALID [2018-11-14 16:26:22,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1920#true} {1920#true} #201#return; {1920#true} is VALID [2018-11-14 16:26:22,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {1920#true} call #t~ret21 := main(); {1920#true} is VALID [2018-11-14 16:26:22,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {1920#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(12bv32);~null~0.base, ~null~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~null~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~null~0.base, ~bvadd32(4bv32, ~null~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~null~0.base, ~bvadd32(8bv32, ~null~0.offset), 4bv32);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(12bv32);~list~0.base, ~list~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~list~0.offset, 4bv32);call write~$Pointer$(~null~0.base, ~null~0.offset, ~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call write~intINTTYPE4(~unnamed1~0~BLACK, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1920#true} is VALID [2018-11-14 16:26:22,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {1920#true} assume true; {1920#true} is VALID [2018-11-14 16:26:22,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {1920#true} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2; {1920#true} is VALID [2018-11-14 16:26:22,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {1920#true} ~end~0.base, ~end~0.offset := ~null~0.base, ~null~0.offset;~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {1920#true} is VALID [2018-11-14 16:26:22,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {1920#true} assume true; {1920#true} is VALID [2018-11-14 16:26:22,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {1920#true} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1920#true} is VALID [2018-11-14 16:26:22,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {1920#true} assume true; {1920#true} is VALID [2018-11-14 16:26:22,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {1920#true} assume true;call #t~mem12 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1961#(= |main_#t~mem12| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 16:26:22,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {1961#(= |main_#t~mem12| (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume !!(~unnamed1~0~BLACK == #t~mem12);havoc #t~mem12; {1965#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 16:26:22,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {1965#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true; {1965#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 16:26:22,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {1965#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume true; {1965#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} is VALID [2018-11-14 16:26:22,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {1965#(= ~unnamed1~0~BLACK (select (select |#memory_int| main_~end~0.base) (bvadd main_~end~0.offset (_ bv8 32))))} assume !!(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset);call #t~mem13 := read~intINTTYPE4(~end~0.base, ~bvadd32(8bv32, ~end~0.offset), 4bv32); {1975#(= ~unnamed1~0~BLACK |main_#t~mem13|)} is VALID [2018-11-14 16:26:22,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {1975#(= ~unnamed1~0~BLACK |main_#t~mem13|)} assume ~unnamed1~0~RED == #t~mem13;havoc #t~mem13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4bv32);~end~0.base, ~end~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {1921#false} is VALID [2018-11-14 16:26:22,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {1921#false} assume true; {1921#false} is VALID [2018-11-14 16:26:22,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {1921#false} assume !(~null~0.base != ~end~0.base || ~null~0.offset != ~end~0.offset); {1921#false} is VALID [2018-11-14 16:26:22,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {1921#false} assume !false; {1921#false} is VALID [2018-11-14 16:26:22,743 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 16:26:22,743 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:26:22,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:26:22,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:26:22,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:26:22,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:26:22,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:26:22,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:26:22,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:26:22,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:26:22,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:26:22,825 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 5 states. [2018-11-14 16:26:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:25,102 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-14 16:26:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:26:25,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-14 16:26:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:26:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:26:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-14 16:26:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:26:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-14 16:26:25,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-14 16:26:25,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:26:25,202 INFO L225 Difference]: With dead ends: 77 [2018-11-14 16:26:25,202 INFO L226 Difference]: Without dead ends: 63 [2018-11-14 16:26:25,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 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 16:26:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-14 16:26:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-14 16:26:25,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:26:25,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-14 16:26:25,296 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-14 16:26:25,296 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-14 16:26:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:25,300 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-14 16:26:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-14 16:26:25,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:25,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:25,300 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-14 16:26:25,301 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-14 16:26:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:26:25,303 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-14 16:26:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-14 16:26:25,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:26:25,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:26:25,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:26:25,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:26:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 16:26:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-11-14 16:26:25,307 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 21 [2018-11-14 16:26:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:26:25,307 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-11-14 16:26:25,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:26:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-11-14 16:26:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:26:25,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:26:25,308 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:26:25,309 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:26:25,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:26:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash 48207544, now seen corresponding path program 1 times [2018-11-14 16:26:25,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:26:25,309 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:26:25,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:26:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:26:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:26:25,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:26:27,435 WARN L179 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2018-11-14 16:26:27,610 INFO L303 Elim1Store]: Index analysis took 172 ms [2018-11-14 16:26:27,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2018-11-14 16:26:27,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-11-14 16:26:27,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:27,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 16:26:27,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:26:27,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:26:27,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 25 [2018-11-14 16:26:28,049 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:26:28,050 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_14 term size 13 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) 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 16:26:28,056 INFO L168 Benchmark]: Toolchain (without parser) took 67213.07 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 875.0 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -158.7 MB). Peak memory consumption was 716.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:28,057 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:26:28,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.8 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:28,057 INFO L168 Benchmark]: Boogie Preprocessor took 123.13 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:26:28,058 INFO L168 Benchmark]: RCFGBuilder took 1795.93 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 78.8 MB). Peak memory consumption was 78.8 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:28,058 INFO L168 Benchmark]: TraceAbstraction took 64523.15 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 153.1 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 541.3 MB). Peak memory consumption was 694.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:26:28,061 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.31 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.8 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.13 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1795.93 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 78.8 MB). Peak memory consumption was 78.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64523.15 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 153.1 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 541.3 MB). Peak memory consumption was 694.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_14 term size 13 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_14 term size 13: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...