java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:12:31,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:12:31,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:12:31,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:12:31,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:12:31,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:12:31,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:12:31,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:12:31,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:12:31,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:12:31,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:12:31,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:12:31,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:12:31,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:12:31,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:12:31,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:12:31,133 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:12:31,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:12:31,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:12:31,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:12:31,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:12:31,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:12:31,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:12:31,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:12:31,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:12:31,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:12:31,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:12:31,157 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:12:31,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:12:31,158 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:12:31,159 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:12:31,159 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:12:31,159 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:12:31,160 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:12:31,161 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:12:31,162 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:12:31,162 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:12:31,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:12:31,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:12:31,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:12:31,181 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:12:31,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:12:31,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:12:31,182 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:12:31,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:12:31,183 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:12:31,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:12:31,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:12:31,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:12:31,183 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:12:31,184 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:12:31,184 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:12:31,184 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:12:31,184 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:12:31,184 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:12:31,184 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:12:31,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:12:31,185 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:12:31,185 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:12:31,185 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:12:31,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:12:31,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:12:31,186 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:12:31,186 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:12:31,186 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:12:31,186 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:12:31,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:12:31,187 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:12:31,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:12:31,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:12:31,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:12:31,266 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:12:31,267 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:12:31,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:12:31,331 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6daa645f/4ac2e0628864455a9e8fd4116cfef6b3/FLAG7eb7191e7 [2018-11-14 19:12:31,817 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:12:31,818 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-token_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:12:31,832 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6daa645f/4ac2e0628864455a9e8fd4116cfef6b3/FLAG7eb7191e7 [2018-11-14 19:12:31,848 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6daa645f/4ac2e0628864455a9e8fd4116cfef6b3 [2018-11-14 19:12:31,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:12:31,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:12:31,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:12:31,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:12:31,864 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:12:31,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:12:31" (1/1) ... [2018-11-14 19:12:31,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ed31fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:31, skipping insertion in model container [2018-11-14 19:12:31,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:12:31" (1/1) ... [2018-11-14 19:12:31,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:12:31,946 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:12:32,400 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:12:32,420 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:12:32,509 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:12:32,655 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:12:32,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32 WrapperNode [2018-11-14 19:12:32,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:12:32,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:12:32,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:12:32,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:12:32,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (1/1) ... [2018-11-14 19:12:32,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (1/1) ... [2018-11-14 19:12:32,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (1/1) ... [2018-11-14 19:12:32,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (1/1) ... [2018-11-14 19:12:32,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (1/1) ... [2018-11-14 19:12:32,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (1/1) ... [2018-11-14 19:12:32,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (1/1) ... [2018-11-14 19:12:32,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:12:32,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:12:32,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:12:32,749 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:12:32,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (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 19:12:32,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:12:32,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:12:32,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:12:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:12:32,817 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:12:32,817 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:12:32,817 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:12:32,817 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:12:32,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:12:32,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:12:32,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:12:32,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:12:32,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:12:32,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:12:32,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:12:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:12:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:12:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:12:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:12:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:12:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:12:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:12:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:12:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:12:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:12:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:12:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:12:32,820 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:12:32,821 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:12:32,822 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:12:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:12:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:12:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:12:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:12:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:12:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:12:32,823 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:12:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:12:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:12:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:12:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:12:32,826 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:12:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:12:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:12:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:12:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:12:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:12:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:12:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:12:32,828 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:12:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:12:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:12:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:12:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:12:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:12:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:12:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:12:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:12:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:12:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:12:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:12:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:12:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:12:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:12:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:12:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:12:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:12:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:12:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:12:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:12:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:12:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:12:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:12:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:12:32,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:12:32,836 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:12:32,836 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:12:32,836 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:12:32,836 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:12:32,836 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:12:32,836 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:12:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:12:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:12:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:12:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:12:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:12:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:12:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:12:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:12:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:12:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:12:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:12:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:12:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:12:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:12:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:12:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:12:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:12:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:12:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:12:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:12:32,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:12:32,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:12:32,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:12:32,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:12:32,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:12:33,978 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:12:33,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:12:33 BoogieIcfgContainer [2018-11-14 19:12:33,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:12:33,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:12:33,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:12:33,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:12:33,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:12:31" (1/3) ... [2018-11-14 19:12:33,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385366d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:12:33, skipping insertion in model container [2018-11-14 19:12:33,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:32" (2/3) ... [2018-11-14 19:12:33,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385366d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:12:33, skipping insertion in model container [2018-11-14 19:12:33,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:12:33" (3/3) ... [2018-11-14 19:12:33,987 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-token_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:12:33,997 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:12:34,006 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-14 19:12:34,023 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-14 19:12:34,055 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:12:34,056 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:12:34,057 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:12:34,057 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:12:34,057 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:12:34,058 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:12:34,058 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:12:34,058 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:12:34,059 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:12:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 19:12:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:12:34,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:34,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:34,092 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:34,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1593703150, now seen corresponding path program 1 times [2018-11-14 19:12:34,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:34,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:34,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:34,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:34,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:34,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 19:12:34,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-14 19:12:34,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 19:12:34,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #172#return; {57#true} is VALID [2018-11-14 19:12:34,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret16 := main(); {57#true} is VALID [2018-11-14 19:12:34,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {57#true} is VALID [2018-11-14 19:12:34,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-14 19:12:34,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {58#false} call write~int(1, ~x~0.base, ~x~0.offset + 4, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem5.base, #t~mem5.offset + 4, 4);havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {58#false} is VALID [2018-11-14 19:12:34,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 19:12:34,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {58#false} is VALID [2018-11-14 19:12:34,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 19:12:34,277 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 19:12:34,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:34,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:12:34,285 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 19:12:34,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:34,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:12:34,426 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 19:12:34,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:12:34,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:12:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:12:34,437 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-14 19:12:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:35,032 INFO L93 Difference]: Finished difference Result 102 states and 148 transitions. [2018-11-14 19:12:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:12:35,032 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 19:12:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:12:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2018-11-14 19:12:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:12:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2018-11-14 19:12:35,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 148 transitions. [2018-11-14 19:12:35,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:35,681 INFO L225 Difference]: With dead ends: 102 [2018-11-14 19:12:35,681 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 19:12:35,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:12:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 19:12:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-14 19:12:35,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:35,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-14 19:12:35,735 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 19:12:35,735 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 19:12:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:35,740 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 19:12:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 19:12:35,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:35,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:35,742 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 19:12:35,742 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 19:12:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:35,747 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 19:12:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 19:12:35,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:35,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:35,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:35,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 19:12:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-14 19:12:35,754 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-11-14 19:12:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:35,755 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-14 19:12:35,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:12:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-14 19:12:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 19:12:35,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:35,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:35,757 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:35,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1276921565, now seen corresponding path program 1 times [2018-11-14 19:12:35,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:35,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:35,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:35,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:35,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:35,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID [2018-11-14 19:12:35,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {333#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {333#true} is VALID [2018-11-14 19:12:35,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-14 19:12:35,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {333#true} {333#true} #172#return; {333#true} is VALID [2018-11-14 19:12:35,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {333#true} call #t~ret16 := main(); {333#true} is VALID [2018-11-14 19:12:35,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {333#true} is VALID [2018-11-14 19:12:35,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-14 19:12:35,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {333#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {333#true} is VALID [2018-11-14 19:12:35,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {333#true} assume !!(#t~nondet1 != 0);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~int(0, ~x~0.base, ~x~0.offset + 4, 4); {335#(not (= main_~x~0.base 0))} is VALID [2018-11-14 19:12:35,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {335#(not (= main_~x~0.base 0))} assume true; {335#(not (= main_~x~0.base 0))} is VALID [2018-11-14 19:12:35,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {335#(not (= main_~x~0.base 0))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {334#false} is VALID [2018-11-14 19:12:35,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {334#false} assume !false; {334#false} is VALID [2018-11-14 19:12:35,922 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 19:12:35,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:35,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:12:35,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 19:12:35,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:35,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:12:36,017 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 19:12:36,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:12:36,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:12:36,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:12:36,019 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 3 states. [2018-11-14 19:12:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:36,314 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 19:12:36,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:12:36,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-14 19:12:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:36,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:12:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 19:12:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:12:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 19:12:36,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 19:12:36,438 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 19:12:36,443 INFO L225 Difference]: With dead ends: 48 [2018-11-14 19:12:36,443 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 19:12:36,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:12:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 19:12:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 19:12:36,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:36,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 19:12:36,483 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 19:12:36,483 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 19:12:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:36,488 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-14 19:12:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 19:12:36,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:36,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:36,489 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 19:12:36,489 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 19:12:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:36,493 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-14 19:12:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 19:12:36,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:36,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:36,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:36,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 19:12:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-14 19:12:36,497 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 12 [2018-11-14 19:12:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:36,497 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-14 19:12:36,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:12:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 19:12:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:12:36,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:36,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:36,499 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:36,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:36,500 INFO L82 PathProgramCache]: Analyzing trace with hash 928632568, now seen corresponding path program 1 times [2018-11-14 19:12:36,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:36,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:36,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:36,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:36,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:36,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-14 19:12:36,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {544#true} is VALID [2018-11-14 19:12:36,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-14 19:12:36,642 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #172#return; {544#true} is VALID [2018-11-14 19:12:36,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret16 := main(); {544#true} is VALID [2018-11-14 19:12:36,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {546#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:12:36,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {546#(not (= 0 main_~head~0.base))} assume true; {546#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:12:36,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {546#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {546#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:12:36,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#(not (= 0 main_~head~0.base))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {546#(not (= 0 main_~head~0.base))} is VALID [2018-11-14 19:12:36,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {546#(not (= 0 main_~head~0.base))} call write~int(1, ~x~0.base, ~x~0.offset + 4, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem5.base, #t~mem5.offset + 4, 4);havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {547#(not (= 0 main_~x~0.base))} is VALID [2018-11-14 19:12:36,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {547#(not (= 0 main_~x~0.base))} assume true; {547#(not (= 0 main_~x~0.base))} is VALID [2018-11-14 19:12:36,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {545#false} is VALID [2018-11-14 19:12:36,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-14 19:12:36,653 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 19:12:36,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:36,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:12:36,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 19:12:36,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:36,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:12:36,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:36,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:12:36,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:12:36,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:12:36,678 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 4 states. [2018-11-14 19:12:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:36,957 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-11-14 19:12:36,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:12:36,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-14 19:12:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:12:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 19:12:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:12:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 19:12:36,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-14 19:12:37,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:37,113 INFO L225 Difference]: With dead ends: 75 [2018-11-14 19:12:37,114 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 19:12:37,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:12:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 19:12:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-11-14 19:12:37,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:37,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 44 states. [2018-11-14 19:12:37,156 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 44 states. [2018-11-14 19:12:37,156 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 44 states. [2018-11-14 19:12:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:37,161 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-14 19:12:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-14 19:12:37,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:37,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:37,162 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 73 states. [2018-11-14 19:12:37,162 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 73 states. [2018-11-14 19:12:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:37,166 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-11-14 19:12:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-11-14 19:12:37,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:37,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:37,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:37,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 19:12:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-14 19:12:37,171 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 13 [2018-11-14 19:12:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:37,171 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-14 19:12:37,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:12:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-14 19:12:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:12:37,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:37,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:37,176 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:37,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:37,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1895008549, now seen corresponding path program 1 times [2018-11-14 19:12:37,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:37,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:37,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:37,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:37,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:37,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2018-11-14 19:12:37,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {840#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {840#true} is VALID [2018-11-14 19:12:37,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-14 19:12:37,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #172#return; {840#true} is VALID [2018-11-14 19:12:37,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret16 := main(); {840#true} is VALID [2018-11-14 19:12:37,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {840#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {840#true} is VALID [2018-11-14 19:12:37,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-14 19:12:37,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {840#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {840#true} is VALID [2018-11-14 19:12:37,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {840#true} assume !(#t~nondet1 != 0);havoc #t~nondet1; {840#true} is VALID [2018-11-14 19:12:37,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {840#true} call write~int(1, ~x~0.base, ~x~0.offset + 4, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem5.base, #t~mem5.offset + 4, 4);havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {840#true} is VALID [2018-11-14 19:12:37,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-14 19:12:37,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {840#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {840#true} is VALID [2018-11-14 19:12:37,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-14 19:12:37,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {840#true} assume true; {840#true} is VALID [2018-11-14 19:12:37,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {840#true} call #t~mem6 := read~int(~x~0.base, ~x~0.offset + 4, 4); {842#(= |main_#t~mem6| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} is VALID [2018-11-14 19:12:37,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {842#(= |main_#t~mem6| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} assume !(1 != #t~mem6);havoc #t~mem6; {843#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} is VALID [2018-11-14 19:12:37,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {843#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} assume true;call #t~mem9 := read~int(~x~0.base, ~x~0.offset + 4, 4); {844#(= |main_#t~mem9| 1)} is VALID [2018-11-14 19:12:37,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {844#(= |main_#t~mem9| 1)} assume !(1 == #t~mem9);havoc #t~mem9; {841#false} is VALID [2018-11-14 19:12:37,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {841#false} assume !false; {841#false} is VALID [2018-11-14 19:12:37,333 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 19:12:37,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:37,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:12:37,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:12:37,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:37,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:12:37,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:37,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:12:37,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:12:37,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:12:37,368 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 5 states. [2018-11-14 19:12:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:37,811 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-14 19:12:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:12:37,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:12:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:37,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 19:12:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 19:12:37,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-14 19:12:37,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:37,902 INFO L225 Difference]: With dead ends: 44 [2018-11-14 19:12:37,903 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 19:12:37,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:12:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 19:12:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 19:12:37,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:37,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 19:12:37,925 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 19:12:37,926 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 19:12:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:37,928 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-14 19:12:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 19:12:37,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:37,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:37,929 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 19:12:37,929 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 19:12:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:37,932 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-14 19:12:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 19:12:37,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:37,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:37,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:37,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 19:12:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-14 19:12:37,935 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 19 [2018-11-14 19:12:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:37,936 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-14 19:12:37,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:12:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 19:12:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:12:37,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:37,937 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:37,937 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:37,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1894971806, now seen corresponding path program 1 times [2018-11-14 19:12:37,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:37,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:38,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {1039#true} call ULTIMATE.init(); {1039#true} is VALID [2018-11-14 19:12:38,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {1039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1039#true} is VALID [2018-11-14 19:12:38,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {1039#true} assume true; {1039#true} is VALID [2018-11-14 19:12:38,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1039#true} {1039#true} #172#return; {1039#true} is VALID [2018-11-14 19:12:38,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {1039#true} call #t~ret16 := main(); {1039#true} is VALID [2018-11-14 19:12:38,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {1039#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset + 0, 4);call write~int(0, ~head~0.base, ~head~0.offset + 4, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1041#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-14 19:12:38,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {1041#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} assume true; {1041#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-14 19:12:38,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {1041#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1041#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-14 19:12:38,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {1041#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} assume !(#t~nondet1 != 0);havoc #t~nondet1; {1041#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} is VALID [2018-11-14 19:12:38,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {1041#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1))} call write~int(1, ~x~0.base, ~x~0.offset + 4, 4);call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);call write~$Pointer$(#t~malloc4.base, #t~malloc4.offset, ~x~0.base, ~x~0.offset + 0, 4);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~x~0.base, ~x~0.offset + 0, 4);call write~int(2, #t~mem5.base, #t~mem5.offset + 4, 4);havoc #t~mem5.base, #t~mem5.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} is VALID [2018-11-14 19:12:38,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} assume true; {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} is VALID [2018-11-14 19:12:38,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} is VALID [2018-11-14 19:12:38,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} assume true; {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} is VALID [2018-11-14 19:12:38,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} assume true; {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} is VALID [2018-11-14 19:12:38,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {1042#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)))} call #t~mem6 := read~int(~x~0.base, ~x~0.offset + 4, 4); {1043#(= |main_#t~mem6| 1)} is VALID [2018-11-14 19:12:38,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {1043#(= |main_#t~mem6| 1)} assume !!(1 != #t~mem6);havoc #t~mem6; {1040#false} is VALID [2018-11-14 19:12:38,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {1040#false} assume true;call #t~mem7 := read~int(~x~0.base, ~x~0.offset + 4, 4); {1040#false} is VALID [2018-11-14 19:12:38,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {1040#false} assume !(0 == #t~mem7);havoc #t~mem7; {1040#false} is VALID [2018-11-14 19:12:38,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {1040#false} assume !false; {1040#false} is VALID [2018-11-14 19:12:38,289 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 19:12:38,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:38,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:12:38,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:12:38,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:38,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:12:38,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:38,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:12:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:12:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:12:38,314 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 5 states. [2018-11-14 19:12:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:38,701 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-14 19:12:38,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:12:38,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-14 19:12:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2018-11-14 19:12:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2018-11-14 19:12:38,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2018-11-14 19:12:38,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:38,819 INFO L225 Difference]: With dead ends: 82 [2018-11-14 19:12:38,819 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 19:12:38,820 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 19:12:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 19:12:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-11-14 19:12:38,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:38,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 52 states. [2018-11-14 19:12:38,856 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 52 states. [2018-11-14 19:12:38,857 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 52 states. [2018-11-14 19:12:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:38,859 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-14 19:12:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 19:12:38,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:38,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:38,860 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 56 states. [2018-11-14 19:12:38,860 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 56 states. [2018-11-14 19:12:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:38,863 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-14 19:12:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-14 19:12:38,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:38,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:38,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:38,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 19:12:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-14 19:12:38,867 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 19 [2018-11-14 19:12:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:38,867 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-14 19:12:38,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:12:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-14 19:12:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 19:12:38,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:38,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:38,869 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:38,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1151742973, now seen corresponding path program 1 times [2018-11-14 19:12:38,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:38,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:38,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:39,039 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:12:39,045 INFO L168 Benchmark]: Toolchain (without parser) took 7186.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -402.8 MB). Peak memory consumption was 332.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:39,047 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:12:39,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.6 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:39,048 INFO L168 Benchmark]: Boogie Preprocessor took 91.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:39,049 INFO L168 Benchmark]: RCFGBuilder took 1230.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:39,050 INFO L168 Benchmark]: TraceAbstraction took 5063.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 310.8 MB). Peak memory consumption was 310.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:39,054 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.6 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.64 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1230.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5063.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 310.8 MB). Peak memory consumption was 310.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...