/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/forester-heap/dll-rb-sentinel-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:20:32,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:20:32,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:20:32,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:20:32,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:20:32,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:20:32,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:20:32,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:20:32,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:20:32,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:20:32,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:20:32,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:20:32,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:20:32,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:20:32,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:20:32,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:20:32,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:20:32,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:20:32,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:20:32,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:20:32,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:20:32,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:20:32,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:20:32,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:20:32,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:20:32,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:20:32,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:20:32,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:20:32,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:20:32,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:20:32,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:20:32,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:20:32,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:20:32,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:20:32,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:20:32,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:20:32,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:20:32,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:20:32,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:20:32,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:20:32,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:20:32,971 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:20:32,984 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:20:32,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:20:32,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:20:32,986 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:20:32,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:20:32,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:20:32,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:20:32,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:20:32,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:20:32,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:20:32,988 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:20:32,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:20:32,988 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:20:32,989 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:20:32,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:20:32,989 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:20:32,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:20:32,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:20:32,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:20:32,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:20:32,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:20:32,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:20:32,991 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:20:33,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:20:33,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:20:33,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:20:33,436 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:20:33,437 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:20:33,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2020-11-07 05:20:33,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3fd6d56/4fb61fdcb526451e862deca87932f851/FLAG0abba45de [2020-11-07 05:20:34,405 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:20:34,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2020-11-07 05:20:34,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3fd6d56/4fb61fdcb526451e862deca87932f851/FLAG0abba45de [2020-11-07 05:20:34,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3fd6d56/4fb61fdcb526451e862deca87932f851 [2020-11-07 05:20:34,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:20:34,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:20:34,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:20:34,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:20:34,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:20:34,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:20:34" (1/1) ... [2020-11-07 05:20:34,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2342913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:34, skipping insertion in model container [2020-11-07 05:20:34,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:20:34" (1/1) ... [2020-11-07 05:20:34,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:20:34,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:20:35,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:20:35,204 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:20:35,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:20:35,319 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:20:35,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35 WrapperNode [2020-11-07 05:20:35,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:20:35,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:20:35,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:20:35,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:20:35,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (1/1) ... [2020-11-07 05:20:35,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (1/1) ... [2020-11-07 05:20:35,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (1/1) ... [2020-11-07 05:20:35,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (1/1) ... [2020-11-07 05:20:35,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (1/1) ... [2020-11-07 05:20:35,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (1/1) ... [2020-11-07 05:20:35,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (1/1) ... [2020-11-07 05:20:35,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:20:35,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:20:35,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:20:35,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:20:35,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (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:20:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:20:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:20:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:20:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:20:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-07 05:20:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-07 05:20:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-07 05:20:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-07 05:20:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-07 05:20:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-07 05:20:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-07 05:20:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-07 05:20:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-07 05:20:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-07 05:20:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-07 05:20:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-07 05:20:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-07 05:20:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-07 05:20:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-07 05:20:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-07 05:20:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-07 05:20:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-07 05:20:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-07 05:20:35,499 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-07 05:20:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-07 05:20:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-07 05:20:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-07 05:20:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-07 05:20:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-07 05:20:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-07 05:20:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-07 05:20:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-07 05:20:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-07 05:20:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-07 05:20:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-07 05:20:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-07 05:20:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-07 05:20:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-07 05:20:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-07 05:20:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-07 05:20:35,502 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-07 05:20:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-07 05:20:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-07 05:20:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-07 05:20:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-07 05:20:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-07 05:20:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-07 05:20:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-07 05:20:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-07 05:20:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-07 05:20:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-07 05:20:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-07 05:20:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-07 05:20:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-07 05:20:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 05:20:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 05:20:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-07 05:20:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 05:20:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-07 05:20:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-07 05:20:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-07 05:20:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-07 05:20:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-07 05:20:35,506 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:20:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-07 05:20:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-07 05:20:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-07 05:20:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-07 05:20:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-07 05:20:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-07 05:20:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-07 05:20:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-07 05:20:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-07 05:20:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-07 05:20:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-07 05:20:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-07 05:20:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-07 05:20:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-07 05:20:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-07 05:20:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-07 05:20:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-07 05:20:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-07 05:20:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-07 05:20:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-07 05:20:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-07 05:20:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-07 05:20:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-07 05:20:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-07 05:20:35,511 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-07 05:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-07 05:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-07 05:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-07 05:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-07 05:20:35,512 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-07 05:20:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-07 05:20:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-07 05:20:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-07 05:20:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-07 05:20:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-07 05:20:35,513 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-07 05:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-07 05:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-07 05:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-07 05:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-07 05:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-07 05:20:35,514 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-07 05:20:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-07 05:20:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:20:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:20:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 05:20:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 05:20:35,515 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:20:35,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:20:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:20:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 05:20:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:20:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:20:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:20:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:20:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:20:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:20:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:20:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:20:36,279 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:20:36,279 INFO L298 CfgBuilder]: Removed 17 assume(true) statements. [2020-11-07 05:20:36,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:20:36 BoogieIcfgContainer [2020-11-07 05:20:36,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:20:36,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:20:36,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:20:36,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:20:36,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:20:34" (1/3) ... [2020-11-07 05:20:36,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1058fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:20:36, skipping insertion in model container [2020-11-07 05:20:36,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:20:35" (2/3) ... [2020-11-07 05:20:36,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1058fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:20:36, skipping insertion in model container [2020-11-07 05:20:36,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:20:36" (3/3) ... [2020-11-07 05:20:36,294 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2020-11-07 05:20:36,313 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:20:36,318 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:20:36,332 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:20:36,361 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:20:36,362 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:20:36,362 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:20:36,362 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:20:36,362 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:20:36,362 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:20:36,363 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:20:36,363 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:20:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2020-11-07 05:20:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-07 05:20:36,398 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:36,399 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] [2020-11-07 05:20:36,400 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1693122140, now seen corresponding path program 1 times [2020-11-07 05:20:36,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:36,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [625958986] [2020-11-07 05:20:36,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:36,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:36,865 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:20:36,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [625958986] [2020-11-07 05:20:36,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:20:36,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 05:20:36,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954298461] [2020-11-07 05:20:36,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 05:20:36,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 05:20:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 05:20:36,919 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 3 states. [2020-11-07 05:20:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:37,493 INFO L93 Difference]: Finished difference Result 234 states and 307 transitions. [2020-11-07 05:20:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 05:20:37,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-11-07 05:20:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:37,524 INFO L225 Difference]: With dead ends: 234 [2020-11-07 05:20:37,524 INFO L226 Difference]: Without dead ends: 100 [2020-11-07 05:20:37,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 05:20:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-07 05:20:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-11-07 05:20:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 05:20:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2020-11-07 05:20:37,623 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 29 [2020-11-07 05:20:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:37,623 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2020-11-07 05:20:37,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 05:20:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2020-11-07 05:20:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-07 05:20:37,625 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:37,625 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] [2020-11-07 05:20:37,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:20:37,626 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:37,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:37,627 INFO L82 PathProgramCache]: Analyzing trace with hash -88926595, now seen corresponding path program 1 times [2020-11-07 05:20:37,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:37,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2050490099] [2020-11-07 05:20:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:37,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:37,828 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:20:37,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2050490099] [2020-11-07 05:20:37,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:20:37,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 05:20:37,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794687530] [2020-11-07 05:20:37,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:20:37,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:37,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:20:37,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:20:37,836 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 8 states. [2020-11-07 05:20:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:38,367 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2020-11-07 05:20:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:20:38,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-11-07 05:20:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:38,370 INFO L225 Difference]: With dead ends: 124 [2020-11-07 05:20:38,370 INFO L226 Difference]: Without dead ends: 120 [2020-11-07 05:20:38,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:20:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-07 05:20:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2020-11-07 05:20:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 05:20:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2020-11-07 05:20:38,395 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 31 [2020-11-07 05:20:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:38,395 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2020-11-07 05:20:38,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:20:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2020-11-07 05:20:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-07 05:20:38,397 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:38,397 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] [2020-11-07 05:20:38,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:20:38,398 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:38,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash -790697485, now seen corresponding path program 1 times [2020-11-07 05:20:38,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:38,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51685812] [2020-11-07 05:20:38,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:38,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:38,678 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:20:38,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51685812] [2020-11-07 05:20:38,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:20:38,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 05:20:38,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856298053] [2020-11-07 05:20:38,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:20:38,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:38,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:20:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:20:38,682 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 9 states. [2020-11-07 05:20:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:39,199 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2020-11-07 05:20:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:20:39,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-11-07 05:20:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:39,202 INFO L225 Difference]: With dead ends: 147 [2020-11-07 05:20:39,202 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 05:20:39,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:20:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 05:20:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 108. [2020-11-07 05:20:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-11-07 05:20:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2020-11-07 05:20:39,230 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 35 [2020-11-07 05:20:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:39,231 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2020-11-07 05:20:39,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:20:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2020-11-07 05:20:39,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 05:20:39,233 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:39,233 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] [2020-11-07 05:20:39,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:20:39,234 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:39,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:39,234 INFO L82 PathProgramCache]: Analyzing trace with hash -748527052, now seen corresponding path program 1 times [2020-11-07 05:20:39,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:39,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943235858] [2020-11-07 05:20:39,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:39,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:39,501 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:20:39,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943235858] [2020-11-07 05:20:39,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:20:39,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:20:39,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137476242] [2020-11-07 05:20:39,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:20:39,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:39,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:20:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:20:39,506 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 6 states. [2020-11-07 05:20:39,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:39,914 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2020-11-07 05:20:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:20:39,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-11-07 05:20:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:39,916 INFO L225 Difference]: With dead ends: 142 [2020-11-07 05:20:39,916 INFO L226 Difference]: Without dead ends: 119 [2020-11-07 05:20:39,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:20:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-07 05:20:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2020-11-07 05:20:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-07 05:20:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2020-11-07 05:20:39,962 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 44 [2020-11-07 05:20:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:39,965 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2020-11-07 05:20:39,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:20:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2020-11-07 05:20:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-07 05:20:39,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:39,974 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] [2020-11-07 05:20:39,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:20:39,974 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:39,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:39,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2004200053, now seen corresponding path program 1 times [2020-11-07 05:20:39,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:39,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742243036] [2020-11-07 05:20:39,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:40,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:40,109 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:20:40,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742243036] [2020-11-07 05:20:40,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:20:40,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-07 05:20:40,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026508340] [2020-11-07 05:20:40,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 05:20:40,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:40,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 05:20:40,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:20:40,112 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 5 states. [2020-11-07 05:20:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:40,429 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2020-11-07 05:20:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 05:20:40,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-11-07 05:20:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:40,431 INFO L225 Difference]: With dead ends: 119 [2020-11-07 05:20:40,431 INFO L226 Difference]: Without dead ends: 114 [2020-11-07 05:20:40,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:20:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-07 05:20:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2020-11-07 05:20:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-07 05:20:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2020-11-07 05:20:40,467 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 44 [2020-11-07 05:20:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:40,467 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2020-11-07 05:20:40,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 05:20:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2020-11-07 05:20:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-07 05:20:40,469 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:40,469 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] [2020-11-07 05:20:40,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:20:40,470 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:40,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash -828430875, now seen corresponding path program 1 times [2020-11-07 05:20:40,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:40,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587860951] [2020-11-07 05:20:40,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:40,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:40,643 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:20:40,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587860951] [2020-11-07 05:20:40,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:20:40,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-07 05:20:40,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060541513] [2020-11-07 05:20:40,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 05:20:40,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 05:20:40,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:20:40,646 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 5 states. [2020-11-07 05:20:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:41,015 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2020-11-07 05:20:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 05:20:41,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-11-07 05:20:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:41,019 INFO L225 Difference]: With dead ends: 115 [2020-11-07 05:20:41,019 INFO L226 Difference]: Without dead ends: 110 [2020-11-07 05:20:41,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:20:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-07 05:20:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2020-11-07 05:20:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-07 05:20:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2020-11-07 05:20:41,040 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 48 [2020-11-07 05:20:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:41,041 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2020-11-07 05:20:41,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 05:20:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2020-11-07 05:20:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-07 05:20:41,042 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:41,042 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] [2020-11-07 05:20:41,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:20:41,043 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:41,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1419930978, now seen corresponding path program 1 times [2020-11-07 05:20:41,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:41,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1498638925] [2020-11-07 05:20:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:41,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:41,350 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:20:41,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1498638925] [2020-11-07 05:20:41,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:20:41,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 05:20:41,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468595619] [2020-11-07 05:20:41,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:20:41,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:41,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:20:41,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:20:41,358 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 14 states. [2020-11-07 05:20:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:42,385 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2020-11-07 05:20:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:20:42,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2020-11-07 05:20:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:42,388 INFO L225 Difference]: With dead ends: 159 [2020-11-07 05:20:42,390 INFO L226 Difference]: Without dead ends: 155 [2020-11-07 05:20:42,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:20:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-07 05:20:42,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2020-11-07 05:20:42,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-11-07 05:20:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2020-11-07 05:20:42,451 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 50 [2020-11-07 05:20:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:42,453 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2020-11-07 05:20:42,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:20:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2020-11-07 05:20:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-07 05:20:42,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:42,455 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:20:42,455 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:42,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1260269010, now seen corresponding path program 1 times [2020-11-07 05:20:42,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:42,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [139066275] [2020-11-07 05:20:42,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:42,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:20:42,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [139066275] [2020-11-07 05:20:42,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:42,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:20:42,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289257905] [2020-11-07 05:20:42,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:20:42,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:42,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:20:42,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:20:42,647 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 7 states. [2020-11-07 05:20:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:43,157 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2020-11-07 05:20:43,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:20:43,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2020-11-07 05:20:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:43,159 INFO L225 Difference]: With dead ends: 163 [2020-11-07 05:20:43,159 INFO L226 Difference]: Without dead ends: 123 [2020-11-07 05:20:43,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:20:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-07 05:20:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-11-07 05:20:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-11-07 05:20:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2020-11-07 05:20:43,188 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 51 [2020-11-07 05:20:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:43,188 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2020-11-07 05:20:43,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:20:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2020-11-07 05:20:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:20:43,189 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:43,190 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, 1] [2020-11-07 05:20:43,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:20:43,190 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:43,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1368636775, now seen corresponding path program 1 times [2020-11-07 05:20:43,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:43,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [959064672] [2020-11-07 05:20:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:43,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:43,752 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:20:43,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [959064672] [2020-11-07 05:20:43,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:20:43,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-07 05:20:43,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191167539] [2020-11-07 05:20:43,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 05:20:43,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:43,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 05:20:43,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:20:43,755 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 19 states. [2020-11-07 05:20:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:45,420 INFO L93 Difference]: Finished difference Result 192 states and 203 transitions. [2020-11-07 05:20:45,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:20:45,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2020-11-07 05:20:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:45,425 INFO L225 Difference]: With dead ends: 192 [2020-11-07 05:20:45,425 INFO L226 Difference]: Without dead ends: 188 [2020-11-07 05:20:45,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=294, Invalid=1112, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 05:20:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-07 05:20:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2020-11-07 05:20:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-07 05:20:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 180 transitions. [2020-11-07 05:20:45,459 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 180 transitions. Word has length 60 [2020-11-07 05:20:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:45,459 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 180 transitions. [2020-11-07 05:20:45,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 05:20:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2020-11-07 05:20:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:20:45,460 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:45,461 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:20:45,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:20:45,461 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash -437498776, now seen corresponding path program 1 times [2020-11-07 05:20:45,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:45,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [641075468] [2020-11-07 05:20:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:46,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:20:46,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [641075468] [2020-11-07 05:20:46,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:46,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:20:46,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091764436] [2020-11-07 05:20:46,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:20:46,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:20:46,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:20:46,179 INFO L87 Difference]: Start difference. First operand 170 states and 180 transitions. Second operand 17 states. [2020-11-07 05:20:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:47,608 INFO L93 Difference]: Finished difference Result 227 states and 241 transitions. [2020-11-07 05:20:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:20:47,609 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-11-07 05:20:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:47,611 INFO L225 Difference]: With dead ends: 227 [2020-11-07 05:20:47,611 INFO L226 Difference]: Without dead ends: 222 [2020-11-07 05:20:47,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:20:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-11-07 05:20:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2020-11-07 05:20:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-11-07 05:20:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2020-11-07 05:20:47,663 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 61 [2020-11-07 05:20:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:47,664 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2020-11-07 05:20:47,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:20:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2020-11-07 05:20:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 05:20:47,665 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:47,665 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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:20:47,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:20:47,666 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1852655105, now seen corresponding path program 1 times [2020-11-07 05:20:47,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:47,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214912133] [2020-11-07 05:20:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:48,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:20:48,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214912133] [2020-11-07 05:20:48,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:48,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:20:48,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439431637] [2020-11-07 05:20:48,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:20:48,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:20:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:20:48,821 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand 23 states. [2020-11-07 05:20:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:50,795 INFO L93 Difference]: Finished difference Result 257 states and 272 transitions. [2020-11-07 05:20:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:20:50,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2020-11-07 05:20:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:50,798 INFO L225 Difference]: With dead ends: 257 [2020-11-07 05:20:50,798 INFO L226 Difference]: Without dead ends: 252 [2020-11-07 05:20:50,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=436, Invalid=1544, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:20:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-11-07 05:20:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 204. [2020-11-07 05:20:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-07 05:20:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2020-11-07 05:20:50,835 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 71 [2020-11-07 05:20:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:50,836 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2020-11-07 05:20:50,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:20:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2020-11-07 05:20:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 05:20:50,837 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:50,837 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2020-11-07 05:20:50,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:20:50,837 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash 692737929, now seen corresponding path program 1 times [2020-11-07 05:20:50,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:50,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1701080160] [2020-11-07 05:20:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:51,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:20:51,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1701080160] [2020-11-07 05:20:51,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:51,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 05:20:51,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745798535] [2020-11-07 05:20:51,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 05:20:51,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:51,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 05:20:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:20:51,486 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 21 states. [2020-11-07 05:20:52,266 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2020-11-07 05:20:52,953 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-11-07 05:20:53,263 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2020-11-07 05:20:53,460 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-11-07 05:20:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:53,900 INFO L93 Difference]: Finished difference Result 215 states and 226 transitions. [2020-11-07 05:20:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:20:53,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2020-11-07 05:20:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:53,902 INFO L225 Difference]: With dead ends: 215 [2020-11-07 05:20:53,902 INFO L226 Difference]: Without dead ends: 211 [2020-11-07 05:20:53,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=354, Invalid=1052, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 05:20:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-11-07 05:20:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2020-11-07 05:20:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-07 05:20:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 215 transitions. [2020-11-07 05:20:53,942 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 215 transitions. Word has length 76 [2020-11-07 05:20:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:53,943 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 215 transitions. [2020-11-07 05:20:53,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 05:20:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 215 transitions. [2020-11-07 05:20:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 05:20:53,946 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:53,946 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:20:53,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:20:53,947 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:53,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash -192042333, now seen corresponding path program 1 times [2020-11-07 05:20:53,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:53,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79148960] [2020-11-07 05:20:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:54,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:20:54,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [79148960] [2020-11-07 05:20:54,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:54,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 05:20:54,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820770357] [2020-11-07 05:20:54,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 05:20:54,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:54,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 05:20:54,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:20:54,765 INFO L87 Difference]: Start difference. First operand 204 states and 215 transitions. Second operand 25 states. [2020-11-07 05:20:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:57,488 INFO L93 Difference]: Finished difference Result 280 states and 297 transitions. [2020-11-07 05:20:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 05:20:57,488 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2020-11-07 05:20:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:57,490 INFO L225 Difference]: With dead ends: 280 [2020-11-07 05:20:57,490 INFO L226 Difference]: Without dead ends: 257 [2020-11-07 05:20:57,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=439, Invalid=2111, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 05:20:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-11-07 05:20:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 220. [2020-11-07 05:20:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-11-07 05:20:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 231 transitions. [2020-11-07 05:20:57,536 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 231 transitions. Word has length 77 [2020-11-07 05:20:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:57,536 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 231 transitions. [2020-11-07 05:20:57,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 05:20:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 231 transitions. [2020-11-07 05:20:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-07 05:20:57,537 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:57,538 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 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:20:57,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:20:57,538 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:57,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1553465055, now seen corresponding path program 2 times [2020-11-07 05:20:57,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:57,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [286276214] [2020-11-07 05:20:57,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:57,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:20:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:20:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:20:57,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [286276214] [2020-11-07 05:20:57,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:20:57,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 05:20:57,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107020291] [2020-11-07 05:20:57,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 05:20:57,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:20:57,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 05:20:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:20:57,973 INFO L87 Difference]: Start difference. First operand 220 states and 231 transitions. Second operand 19 states. [2020-11-07 05:20:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:20:59,756 INFO L93 Difference]: Finished difference Result 262 states and 275 transitions. [2020-11-07 05:20:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 05:20:59,757 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2020-11-07 05:20:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:20:59,759 INFO L225 Difference]: With dead ends: 262 [2020-11-07 05:20:59,760 INFO L226 Difference]: Without dead ends: 215 [2020-11-07 05:20:59,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 05:20:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-11-07 05:20:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 204. [2020-11-07 05:20:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-07 05:20:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2020-11-07 05:20:59,817 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 84 [2020-11-07 05:20:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:20:59,817 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2020-11-07 05:20:59,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 05:20:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2020-11-07 05:20:59,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-07 05:20:59,818 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:20:59,819 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2020-11-07 05:20:59,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:20:59,819 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:20:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:20:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash 627452178, now seen corresponding path program 1 times [2020-11-07 05:20:59,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:20:59,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152965363] [2020-11-07 05:20:59,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:20:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:00,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:00,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152965363] [2020-11-07 05:21:00,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:00,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 05:21:00,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84344276] [2020-11-07 05:21:00,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 05:21:00,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 05:21:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2020-11-07 05:21:00,660 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 26 states. [2020-11-07 05:21:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:03,041 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2020-11-07 05:21:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:21:03,041 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2020-11-07 05:21:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:03,044 INFO L225 Difference]: With dead ends: 233 [2020-11-07 05:21:03,044 INFO L226 Difference]: Without dead ends: 229 [2020-11-07 05:21:03,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=484, Invalid=1678, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 05:21:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-11-07 05:21:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 204. [2020-11-07 05:21:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-07 05:21:03,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2020-11-07 05:21:03,079 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 86 [2020-11-07 05:21:03,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:03,079 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2020-11-07 05:21:03,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 05:21:03,080 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2020-11-07 05:21:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-07 05:21:03,081 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:03,081 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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] [2020-11-07 05:21:03,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:21:03,081 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:03,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash -818948451, now seen corresponding path program 2 times [2020-11-07 05:21:03,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:03,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [901649986] [2020-11-07 05:21:03,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:04,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:04,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [901649986] [2020-11-07 05:21:04,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:04,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:21:04,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712505207] [2020-11-07 05:21:04,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:21:04,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:04,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:21:04,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:21:04,082 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 23 states. [2020-11-07 05:21:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:06,214 INFO L93 Difference]: Finished difference Result 284 states and 299 transitions. [2020-11-07 05:21:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:21:06,215 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2020-11-07 05:21:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:06,217 INFO L225 Difference]: With dead ends: 284 [2020-11-07 05:21:06,217 INFO L226 Difference]: Without dead ends: 279 [2020-11-07 05:21:06,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=458, Invalid=1522, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:21:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-11-07 05:21:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2020-11-07 05:21:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-11-07 05:21:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 242 transitions. [2020-11-07 05:21:06,259 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 242 transitions. Word has length 87 [2020-11-07 05:21:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:06,259 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 242 transitions. [2020-11-07 05:21:06,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:21:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 242 transitions. [2020-11-07 05:21:06,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-07 05:21:06,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:06,261 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:21:06,261 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:06,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:06,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2079066682, now seen corresponding path program 1 times [2020-11-07 05:21:06,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:06,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883151260] [2020-11-07 05:21:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:07,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:07,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883151260] [2020-11-07 05:21:07,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:07,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 05:21:07,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151971331] [2020-11-07 05:21:07,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 05:21:07,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:07,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 05:21:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:21:07,075 INFO L87 Difference]: Start difference. First operand 230 states and 242 transitions. Second operand 25 states. [2020-11-07 05:21:08,567 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-11-07 05:21:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:10,129 INFO L93 Difference]: Finished difference Result 301 states and 318 transitions. [2020-11-07 05:21:10,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 05:21:10,130 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2020-11-07 05:21:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:10,131 INFO L225 Difference]: With dead ends: 301 [2020-11-07 05:21:10,132 INFO L226 Difference]: Without dead ends: 297 [2020-11-07 05:21:10,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=398, Invalid=2152, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 05:21:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2020-11-07 05:21:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 254. [2020-11-07 05:21:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-07 05:21:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 267 transitions. [2020-11-07 05:21:10,183 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 267 transitions. Word has length 87 [2020-11-07 05:21:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:10,183 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 267 transitions. [2020-11-07 05:21:10,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 05:21:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 267 transitions. [2020-11-07 05:21:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-07 05:21:10,191 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:10,191 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:21:10,191 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash 352095152, now seen corresponding path program 1 times [2020-11-07 05:21:10,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:10,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904986166] [2020-11-07 05:21:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:21:10,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:21:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:21:10,269 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:21:10,324 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:21:10,324 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:21:10,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:21:10,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:21:10 BoogieIcfgContainer [2020-11-07 05:21:10,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:21:10,436 INFO L168 Benchmark]: Toolchain (without parser) took 35765.29 ms. Allocated memory was 153.1 MB in the beginning and 453.0 MB in the end (delta: 299.9 MB). Free memory was 128.0 MB in the beginning and 343.5 MB in the end (delta: -215.5 MB). Peak memory consumption was 85.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:10,437 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 153.1 MB. Free memory is still 128.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:21:10,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 641.23 ms. Allocated memory is still 153.1 MB. Free memory was 127.4 MB in the beginning and 105.1 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:10,444 INFO L168 Benchmark]: Boogie Preprocessor took 83.26 ms. Allocated memory is still 153.1 MB. Free memory was 105.1 MB in the beginning and 102.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:10,445 INFO L168 Benchmark]: RCFGBuilder took 876.42 ms. Allocated memory is still 153.1 MB. Free memory was 102.1 MB in the beginning and 88.2 MB in the end (delta: 13.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:10,450 INFO L168 Benchmark]: TraceAbstraction took 34146.50 ms. Allocated memory was 153.1 MB in the beginning and 453.0 MB in the end (delta: 299.9 MB). Free memory was 87.7 MB in the beginning and 343.5 MB in the end (delta: -255.9 MB). Peak memory consumption was 43.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:21:10,456 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.22 ms. Allocated memory is still 153.1 MB. Free memory is still 128.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 641.23 ms. Allocated memory is still 153.1 MB. Free memory was 127.4 MB in the beginning and 105.1 MB in the end (delta: 22.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 83.26 ms. Allocated memory is still 153.1 MB. Free memory was 105.1 MB in the beginning and 102.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 876.42 ms. Allocated memory is still 153.1 MB. Free memory was 102.1 MB in the beginning and 88.2 MB in the end (delta: 13.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 34146.50 ms. Allocated memory was 153.1 MB in the beginning and 453.0 MB in the end (delta: 299.9 MB). Free memory was 87.7 MB in the beginning and 343.5 MB in the end (delta: -255.9 MB). Peak memory consumption was 43.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 985]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={-1:0}, null={-1:0}] [L999] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={-1:0}, null={-1:0}] [L1000] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={-1:0}, null={-1:0}] [L1001] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={-1:0}, null={-1:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1004] list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1005] list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1006] list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1008] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1011] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1014] end->next = malloc(sizeof(struct TSLL)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1015] EXPR end->next VAL [end={-2:0}, end->next={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1015] end->next->prev = end VAL [end={-2:0}, end->next={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1016] EXPR end->next VAL [end={-2:0}, end->next={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1016] end = end->next VAL [end={-3:0}, end->next={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1017] end->next = null VAL [end={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1019] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1025] end->colour = RED VAL [end={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1026] end->next = malloc(sizeof(struct TSLL)) VAL [end={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1027] EXPR end->next VAL [end={-3:0}, end->next={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1027] end->next->prev = end VAL [end={-3:0}, end->next={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1028] EXPR end->next VAL [end={-3:0}, end->next={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1028] end = end->next VAL [end={-4:0}, end->next={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1029] end->next = null VAL [end={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1030] end->colour = BLACK VAL [end={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1032] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1032] COND FALSE !(!(BLACK == end->colour)) VAL [end={-4:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1033] EXPR end->next VAL [end={-4:0}, end->next={-1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1033] COND FALSE !(!(null == end->next)) VAL [end={-4:0}, end->next={-1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1034] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1037] end = null VAL [end={-1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1038] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1042] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1043] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1045] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1045] COND FALSE !(RED == end->colour) VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1052] EXPR end->next VAL [end={-2:0}, end->next={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1052] end = end->next VAL [end={-3:0}, end->next={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1043] COND TRUE null != end VAL [end={-3:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1045] EXPR end->colour VAL [end={-3:0}, end->colour=0, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1045] COND TRUE RED == end->colour VAL [end={-3:0}, end->colour=0, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1047] EXPR end->next VAL [end={-3:0}, end->next={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1047] end = end->next VAL [end={-4:0}, end->next={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1048] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1049] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1049] COND TRUE !(BLACK != end->colour) VAL [end={-4:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-1:0}] [L1049] CALL reach_error() [L985] COND FALSE !(0) [L985] __assert_fail ("0", "dll-rb-sentinel-1.c", 14, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 133 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.9s, OverallIterations: 18, TraceHistogramMax: 3, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1399 SDtfs, 7268 SDslu, 8115 SDs, 0 SdLazy, 9818 SolverSat, 1257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 439 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 376 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1112 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1004 ConstructedInterpolants, 0 QuantifiedInterpolants, 780296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 6/110 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...