/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:21:37,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:21:37,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:21:37,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:21:37,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:21:37,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:21:37,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:21:37,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:21:37,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:21:37,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:21:37,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:21:37,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:21:37,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:21:37,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:21:37,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:21:37,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:21:37,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:21:37,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:21:37,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:21:37,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:21:37,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:21:37,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:21:37,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:21:37,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:21:37,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:21:37,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:21:37,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:21:37,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:21:37,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:21:37,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:21:37,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:21:37,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:21:37,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:21:37,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:21:37,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:21:37,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:21:37,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:21:37,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:21:37,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:21:37,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:21:37,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:21:37,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:21:37,814 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:21:37,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:21:37,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:21:37,819 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:21:37,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:21:37,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:21:37,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:21:37,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:21:37,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:21:37,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:21:37,821 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:21:37,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:21:37,822 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:21:37,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:21:37,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:21:37,823 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:21:37,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:21:37,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:21:37,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:21:37,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:21:37,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:21:37,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:21:37,824 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:21:38,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:21:38,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:21:38,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:21:38,268 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:21:38,269 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:21:38,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-11-07 05:21:38,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e4fa3ae/c48eb55dd8dd462989dfa05b4efa9388/FLAG16e4e47c9 [2020-11-07 05:21:39,113 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:21:39,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-1.i [2020-11-07 05:21:39,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e4fa3ae/c48eb55dd8dd462989dfa05b4efa9388/FLAG16e4e47c9 [2020-11-07 05:21:39,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e4fa3ae/c48eb55dd8dd462989dfa05b4efa9388 [2020-11-07 05:21:39,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:21:39,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:21:39,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:39,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:21:39,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:21:39,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:39" (1/1) ... [2020-11-07 05:21:39,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbd1d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:39, skipping insertion in model container [2020-11-07 05:21:39,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:39" (1/1) ... [2020-11-07 05:21:39,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:21:39,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:21:39,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:39,837 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:21:39,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:40,004 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:21:40,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40 WrapperNode [2020-11-07 05:21:40,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:40,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:21:40,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:21:40,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:21:40,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:21:40,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:21:40,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:21:40,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:21:40,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (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 [2020-11-07 05:21:40,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:21:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:21:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:21:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-07 05:21:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-07 05:21:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-07 05:21:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-11-07 05:21:40,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:21:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:21:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:21:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 05:21:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 05:21:40,197 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:21:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:21:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:21:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-07 05:21:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-07 05:21:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-07 05:21:40,198 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-07 05:21:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-07 05:21:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-07 05:21:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-07 05:21:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-07 05:21:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-07 05:21:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-07 05:21:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-07 05:21:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-07 05:21:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-07 05:21:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-07 05:21:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-07 05:21:40,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-07 05:21:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-07 05:21:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-07 05:21:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-07 05:21:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-07 05:21:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-07 05:21:40,201 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-07 05:21:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-07 05:21:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-07 05:21:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-07 05:21:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-07 05:21:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-07 05:21:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-07 05:21:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-07 05:21:40,202 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-07 05:21:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-07 05:21:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-07 05:21:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-07 05:21:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-07 05:21:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-07 05:21:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-07 05:21:40,203 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-07 05:21:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-07 05:21:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-07 05:21:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-07 05:21:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-07 05:21:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-07 05:21:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-07 05:21:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-07 05:21:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-07 05:21:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-07 05:21:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-07 05:21:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-07 05:21:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-07 05:21:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-07 05:21:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-07 05:21:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-07 05:21:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 05:21:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 05:21:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-07 05:21:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 05:21:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-07 05:21:40,206 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-07 05:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-07 05:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-07 05:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-07 05:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-07 05:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-07 05:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-07 05:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-07 05:21:40,207 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-07 05:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-07 05:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-07 05:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-07 05:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-07 05:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-07 05:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-07 05:21:40,208 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-07 05:21:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-07 05:21:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-07 05:21:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-07 05:21:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-07 05:21:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-07 05:21:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-07 05:21:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-07 05:21:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-07 05:21:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-07 05:21:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-07 05:21:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-07 05:21:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-07 05:21:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-07 05:21:40,210 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-07 05:21:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-07 05:21:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-07 05:21:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-07 05:21:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-07 05:21:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-07 05:21:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-07 05:21:40,211 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-07 05:21:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-07 05:21:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-07 05:21:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-07 05:21:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-07 05:21:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-07 05:21:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-07 05:21:40,212 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-07 05:21:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-07 05:21:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-07 05:21:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-07 05:21:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-07 05:21:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-11-07 05:21:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 05:21:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:21:40,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:21:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:21:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:21:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:21:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:21:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:21:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:21:40,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:21:40,625 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-07 05:21:40,868 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:21:40,868 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-07 05:21:40,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:40 BoogieIcfgContainer [2020-11-07 05:21:40,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:21:40,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:21:40,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:21:40,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:21:40,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:21:39" (1/3) ... [2020-11-07 05:21:40,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcf6ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:40, skipping insertion in model container [2020-11-07 05:21:40,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40" (2/3) ... [2020-11-07 05:21:40,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcf6ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:40, skipping insertion in model container [2020-11-07 05:21:40,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:40" (3/3) ... [2020-11-07 05:21:40,880 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2020-11-07 05:21:40,896 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:21:40,900 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:21:40,913 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:21:40,939 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:21:40,939 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:21:40,940 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:21:40,940 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:21:40,940 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:21:40,940 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:21:40,940 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:21:40,940 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:21:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2020-11-07 05:21:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-07 05:21:40,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:40,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:40,973 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:40,979 INFO L82 PathProgramCache]: Analyzing trace with hash 395394382, now seen corresponding path program 1 times [2020-11-07 05:21:40,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:40,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2050382365] [2020-11-07 05:21:40,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:41,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:41,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:41,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2050382365] [2020-11-07 05:21:41,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:41,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 05:21:41,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899882578] [2020-11-07 05:21:41,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:21:41,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:41,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:21:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:41,499 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 7 states. [2020-11-07 05:21:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:42,023 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2020-11-07 05:21:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:21:42,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-11-07 05:21:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:42,036 INFO L225 Difference]: With dead ends: 202 [2020-11-07 05:21:42,036 INFO L226 Difference]: Without dead ends: 118 [2020-11-07 05:21:42,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-11-07 05:21:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2020-11-07 05:21:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 05:21:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2020-11-07 05:21:42,099 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 38 [2020-11-07 05:21:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:42,099 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2020-11-07 05:21:42,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:21:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2020-11-07 05:21:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:21:42,102 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:42,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:42,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:21:42,103 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash -346510149, now seen corresponding path program 1 times [2020-11-07 05:21:42,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:42,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [963612562] [2020-11-07 05:21:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:42,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:42,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:42,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [963612562] [2020-11-07 05:21:42,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:42,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 05:21:42,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442660488] [2020-11-07 05:21:42,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:21:42,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:42,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:21:42,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:42,417 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 11 states. [2020-11-07 05:21:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:43,082 INFO L93 Difference]: Finished difference Result 230 states and 254 transitions. [2020-11-07 05:21:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:21:43,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-11-07 05:21:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:43,087 INFO L225 Difference]: With dead ends: 230 [2020-11-07 05:21:43,087 INFO L226 Difference]: Without dead ends: 173 [2020-11-07 05:21:43,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-07 05:21:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2020-11-07 05:21:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-11-07 05:21:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2020-11-07 05:21:43,110 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 57 [2020-11-07 05:21:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:43,111 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2020-11-07 05:21:43,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:21:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2020-11-07 05:21:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-07 05:21:43,114 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:43,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:43,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:21:43,114 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:43,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1373842663, now seen corresponding path program 1 times [2020-11-07 05:21:43,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:43,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1412927572] [2020-11-07 05:21:43,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:43,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1412927572] [2020-11-07 05:21:43,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:43,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-07 05:21:43,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962381967] [2020-11-07 05:21:43,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 05:21:43,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 05:21:43,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:21:43,243 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 5 states. [2020-11-07 05:21:43,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:43,538 INFO L93 Difference]: Finished difference Result 229 states and 253 transitions. [2020-11-07 05:21:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 05:21:43,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2020-11-07 05:21:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:43,540 INFO L225 Difference]: With dead ends: 229 [2020-11-07 05:21:43,540 INFO L226 Difference]: Without dead ends: 130 [2020-11-07 05:21:43,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-07 05:21:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-11-07 05:21:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-07 05:21:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2020-11-07 05:21:43,560 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 58 [2020-11-07 05:21:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:43,561 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2020-11-07 05:21:43,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 05:21:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2020-11-07 05:21:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:21:43,563 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:43,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:43,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:21:43,564 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash -526711592, now seen corresponding path program 1 times [2020-11-07 05:21:43,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:43,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1906936284] [2020-11-07 05:21:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:43,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1906936284] [2020-11-07 05:21:43,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:43,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:21:43,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140475804] [2020-11-07 05:21:43,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:21:43,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:43,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:21:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:21:43,719 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 9 states. [2020-11-07 05:21:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:44,251 INFO L93 Difference]: Finished difference Result 225 states and 247 transitions. [2020-11-07 05:21:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:21:44,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2020-11-07 05:21:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:44,254 INFO L225 Difference]: With dead ends: 225 [2020-11-07 05:21:44,254 INFO L226 Difference]: Without dead ends: 157 [2020-11-07 05:21:44,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:21:44,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-07 05:21:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2020-11-07 05:21:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 05:21:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2020-11-07 05:21:44,287 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 59 [2020-11-07 05:21:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:44,287 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2020-11-07 05:21:44,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:21:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2020-11-07 05:21:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 05:21:44,294 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:44,294 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:44,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:21:44,294 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2013836794, now seen corresponding path program 1 times [2020-11-07 05:21:44,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:44,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [952311701] [2020-11-07 05:21:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:44,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:44,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:44,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [952311701] [2020-11-07 05:21:44,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:44,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:21:44,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47656644] [2020-11-07 05:21:44,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:21:44,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:21:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:44,503 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 11 states. [2020-11-07 05:21:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:45,052 INFO L93 Difference]: Finished difference Result 256 states and 281 transitions. [2020-11-07 05:21:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:21:45,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2020-11-07 05:21:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:45,054 INFO L225 Difference]: With dead ends: 256 [2020-11-07 05:21:45,054 INFO L226 Difference]: Without dead ends: 183 [2020-11-07 05:21:45,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:21:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-11-07 05:21:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2020-11-07 05:21:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-11-07 05:21:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2020-11-07 05:21:45,095 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 77 [2020-11-07 05:21:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:45,097 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2020-11-07 05:21:45,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:21:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2020-11-07 05:21:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-11-07 05:21:45,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:45,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:45,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:21:45,112 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:45,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1518302727, now seen corresponding path program 2 times [2020-11-07 05:21:45,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:45,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468222782] [2020-11-07 05:21:45,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 05:21:45,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468222782] [2020-11-07 05:21:45,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:45,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:21:45,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867320181] [2020-11-07 05:21:45,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:21:45,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:21:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:45,332 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand 7 states. [2020-11-07 05:21:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:45,710 INFO L93 Difference]: Finished difference Result 244 states and 267 transitions. [2020-11-07 05:21:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:21:45,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2020-11-07 05:21:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:45,712 INFO L225 Difference]: With dead ends: 244 [2020-11-07 05:21:45,712 INFO L226 Difference]: Without dead ends: 140 [2020-11-07 05:21:45,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:21:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-07 05:21:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-11-07 05:21:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-11-07 05:21:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2020-11-07 05:21:45,735 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 96 [2020-11-07 05:21:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:45,735 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2020-11-07 05:21:45,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:21:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2020-11-07 05:21:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:21:45,737 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:45,737 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:45,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:21:45,738 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:45,738 INFO L82 PathProgramCache]: Analyzing trace with hash 687166417, now seen corresponding path program 3 times [2020-11-07 05:21:45,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:45,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1616546066] [2020-11-07 05:21:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:46,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1616546066] [2020-11-07 05:21:46,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:46,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:21:46,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110784806] [2020-11-07 05:21:46,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:21:46,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:46,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:21:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:21:46,123 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 13 states. [2020-11-07 05:21:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:46,634 INFO L93 Difference]: Finished difference Result 242 states and 261 transitions. [2020-11-07 05:21:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:21:46,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2020-11-07 05:21:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:46,639 INFO L225 Difference]: With dead ends: 242 [2020-11-07 05:21:46,639 INFO L226 Difference]: Without dead ends: 180 [2020-11-07 05:21:46,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:21:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-11-07 05:21:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 161. [2020-11-07 05:21:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-11-07 05:21:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2020-11-07 05:21:46,667 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 97 [2020-11-07 05:21:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:46,669 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2020-11-07 05:21:46,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:21:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2020-11-07 05:21:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 05:21:46,672 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:46,673 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:46,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:21:46,673 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:46,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1126200804, now seen corresponding path program 4 times [2020-11-07 05:21:46,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:46,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474213480] [2020-11-07 05:21:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:47,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474213480] [2020-11-07 05:21:47,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:47,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:21:47,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932580149] [2020-11-07 05:21:47,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:21:47,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:47,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:21:47,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:21:47,117 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand 15 states. [2020-11-07 05:21:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:47,777 INFO L93 Difference]: Finished difference Result 263 states and 283 transitions. [2020-11-07 05:21:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:21:47,778 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-11-07 05:21:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:47,779 INFO L225 Difference]: With dead ends: 263 [2020-11-07 05:21:47,780 INFO L226 Difference]: Without dead ends: 201 [2020-11-07 05:21:47,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:21:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-11-07 05:21:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 182. [2020-11-07 05:21:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-11-07 05:21:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2020-11-07 05:21:47,806 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 117 [2020-11-07 05:21:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:47,806 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2020-11-07 05:21:47,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:21:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2020-11-07 05:21:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-07 05:21:47,808 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:47,809 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:47,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:21:47,809 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 744664295, now seen corresponding path program 5 times [2020-11-07 05:21:47,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:47,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1601964747] [2020-11-07 05:21:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:47,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:48,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-11-07 05:21:48,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1601964747] [2020-11-07 05:21:48,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:48,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:21:48,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494351728] [2020-11-07 05:21:48,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:21:48,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:21:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:48,397 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand 17 states. [2020-11-07 05:21:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:49,320 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2020-11-07 05:21:49,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:21:49,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 137 [2020-11-07 05:21:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:49,323 INFO L225 Difference]: With dead ends: 292 [2020-11-07 05:21:49,323 INFO L226 Difference]: Without dead ends: 235 [2020-11-07 05:21:49,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2020-11-07 05:21:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-07 05:21:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 188. [2020-11-07 05:21:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-11-07 05:21:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2020-11-07 05:21:49,361 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 137 [2020-11-07 05:21:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:49,362 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2020-11-07 05:21:49,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:21:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2020-11-07 05:21:49,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2020-11-07 05:21:49,373 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:49,373 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:49,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:21:49,374 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash 119908868, now seen corresponding path program 1 times [2020-11-07 05:21:49,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:49,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [935417408] [2020-11-07 05:21:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:49,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:49,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-11-07 05:21:50,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [935417408] [2020-11-07 05:21:50,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:50,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:21:50,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373771509] [2020-11-07 05:21:50,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:21:50,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:50,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:21:50,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:21:50,039 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 18 states. [2020-11-07 05:21:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:51,356 INFO L93 Difference]: Finished difference Result 292 states and 316 transitions. [2020-11-07 05:21:51,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 05:21:51,357 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 139 [2020-11-07 05:21:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:51,359 INFO L225 Difference]: With dead ends: 292 [2020-11-07 05:21:51,359 INFO L226 Difference]: Without dead ends: 235 [2020-11-07 05:21:51,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:21:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-07 05:21:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 192. [2020-11-07 05:21:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-11-07 05:21:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2020-11-07 05:21:51,409 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 139 [2020-11-07 05:21:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:51,410 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2020-11-07 05:21:51,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:21:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2020-11-07 05:21:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-07 05:21:51,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:51,412 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:51,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:21:51,412 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:51,413 INFO L82 PathProgramCache]: Analyzing trace with hash -181313322, now seen corresponding path program 1 times [2020-11-07 05:21:51,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:51,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800889984] [2020-11-07 05:21:51,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:21:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2020-11-07 05:21:51,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800889984] [2020-11-07 05:21:51,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:51,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:21:51,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102560597] [2020-11-07 05:21:51,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:21:51,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:21:51,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:51,925 INFO L87 Difference]: Start difference. First operand 192 states and 205 transitions. Second operand 17 states. [2020-11-07 05:21:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:52,804 INFO L93 Difference]: Finished difference Result 265 states and 284 transitions. [2020-11-07 05:21:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:21:52,804 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2020-11-07 05:21:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:52,806 INFO L225 Difference]: With dead ends: 265 [2020-11-07 05:21:52,806 INFO L226 Difference]: Without dead ends: 235 [2020-11-07 05:21:52,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2020-11-07 05:21:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2020-11-07 05:21:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2020-11-07 05:21:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-07 05:21:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 213 transitions. [2020-11-07 05:21:52,838 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 213 transitions. Word has length 141 [2020-11-07 05:21:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:52,839 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 213 transitions. [2020-11-07 05:21:52,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:21:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 213 transitions. [2020-11-07 05:21:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-11-07 05:21:52,841 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:52,841 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:52,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:21:52,841 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:52,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:52,842 INFO L82 PathProgramCache]: Analyzing trace with hash -917975359, now seen corresponding path program 1 times [2020-11-07 05:21:52,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:52,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246600489] [2020-11-07 05:21:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:21:52,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:21:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:21:52,977 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:21:53,062 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:21:53,063 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:21:53,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:21:53,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:21:53 BoogieIcfgContainer [2020-11-07 05:21:53,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:21:53,201 INFO L168 Benchmark]: Toolchain (without parser) took 13785.24 ms. Allocated memory was 162.5 MB in the beginning and 282.1 MB in the end (delta: 119.5 MB). Free memory was 138.1 MB in the beginning and 130.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 129.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:53,201 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 162.5 MB. Free memory is still 137.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:21:53,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.44 ms. Allocated memory is still 162.5 MB. Free memory was 137.4 MB in the beginning and 115.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:53,205 INFO L168 Benchmark]: Boogie Preprocessor took 103.80 ms. Allocated memory is still 162.5 MB. Free memory was 115.4 MB in the beginning and 144.9 MB in the end (delta: -29.5 MB). Peak memory consumption was 6.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:53,206 INFO L168 Benchmark]: RCFGBuilder took 759.55 ms. Allocated memory is still 162.5 MB. Free memory was 144.9 MB in the beginning and 96.1 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:53,209 INFO L168 Benchmark]: TraceAbstraction took 12325.30 ms. Allocated memory was 162.5 MB in the beginning and 282.1 MB in the end (delta: 119.5 MB). Free memory was 95.6 MB in the beginning and 130.0 MB in the end (delta: -34.4 MB). Peak memory consumption was 85.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:53,217 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 162.5 MB. Free memory is still 137.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 585.44 ms. Allocated memory is still 162.5 MB. Free memory was 137.4 MB in the beginning and 115.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 103.80 ms. Allocated memory is still 162.5 MB. Free memory was 115.4 MB in the beginning and 144.9 MB in the end (delta: -29.5 MB). Peak memory consumption was 6.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 759.55 ms. Allocated memory is still 162.5 MB. Free memory was 144.9 MB in the beginning and 96.1 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12325.30 ms. Allocated memory was 162.5 MB in the beginning and 282.1 MB in the end (delta: 119.5 MB). Free memory was 95.6 MB in the beginning and 130.0 MB in the end (delta: -34.4 MB). Peak memory consumption was 85.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L599] const int len = 5; VAL [len=5] [L600] CALL, EXPR dll_create(len) VAL [\old(len)=5] [L579] DLL head = ((void *)0); VAL [\old(len)=5, head={0:0}, len=5] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={0:0}, len=5] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=5, __VERIFIER_nondet_int() == len? 1 : 0=1, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L588] new_head->next = head VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L590] COND FALSE !(\read(head)) VAL [\old(len)=5, head={0:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L593] head = new_head VAL [\old(len)=5, head={-1:0}, len=5, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L594] len-- VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=4, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-1:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L593] head = new_head VAL [\old(len)=5, head={-2:0}, len=4, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L594] len-- VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=3, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-2:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L593] head = new_head VAL [\old(len)=5, head={-3:0}, len=3, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L594] len-- VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=2, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-3:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L593] head = new_head VAL [\old(len)=5, head={-4:0}, len=2, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L594] len-- VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L580] COND TRUE len > 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-4:0}, new_head={-4:0}] [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L582] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L585] new_head->data_0 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L586] new_head->data_1 = 0 VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 VAL [\old(len)=5, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int() == len? 1 : 0=1, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L588] new_head->next = head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L589] new_head->prev = ((void *)0) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L590] COND TRUE \read(head) VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L591] head->prev = new_head VAL [\old(len)=5, head={-4:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L593] head = new_head VAL [\old(len)=5, head={-5:0}, len=1, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L594] len-- VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L580] COND FALSE !(len > 0) VAL [\old(len)=5, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L596] return head; VAL [\old(len)=5, \result={-5:0}, head={-5:0}, len=0, malloc(sizeof(struct node))={-5:0}, new_head={-5:0}] [L600] RET, EXPR dll_create(len) VAL [dll_create(len)={-5:0}, len=5] [L600] DLL head = dll_create(len); VAL [dll_create(len)={-5:0}, head={-5:0}, len=5] [L601] head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L601] COND TRUE head->next VAL [head={-5:0}, head->next={-4:0}, len=5] [L602] EXPR head->data_0 VAL [head={-5:0}, head->data_0=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, len=5] [L602] EXPR head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [0 != head->data_0 || 0 != head->data_1=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, len=5] [L602] EXPR head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=0, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [0 != head->data_0 || 0 != head->data_1=0, 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2=1, head={-5:0}, head->data_0=0, head->data_1=0, head->data_2=1, len=5] [L616] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "dll_nullified-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.1s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1098 SDtfs, 1424 SDslu, 7015 SDs, 0 SdLazy, 4041 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 67 SyntacticMatches, 12 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 289 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1157 NumberOfCodeBlocks, 1157 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 402888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 595/869 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...