/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:21:20,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:21:20,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:21:20,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:21:20,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:21:20,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:21:20,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:21:20,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:21:20,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:21:20,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:21:20,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:21:20,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:21:20,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:21:20,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:21:20,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:21:20,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:21:20,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:21:20,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:21:20,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:21:20,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:21:20,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:21:21,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:21:21,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:21:21,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:21:21,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:21:21,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:21:21,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:21:21,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:21:21,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:21:21,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:21:21,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:21:21,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:21:21,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:21:21,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:21:21,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:21:21,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:21:21,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:21:21,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:21:21,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:21:21,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:21:21,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:21:21,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:21:21,081 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:21:21,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:21:21,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:21:21,086 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:21:21,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:21:21,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:21:21,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:21:21,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:21:21,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:21:21,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:21:21,089 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:21:21,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:21:21,089 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:21:21,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:21:21,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:21:21,091 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:21:21,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:21:21,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:21:21,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:21:21,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:21:21,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:21:21,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:21:21,092 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:21:21,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:21:21,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:21:21,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:21:21,588 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:21:21,589 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:21:21,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-11-07 05:21:21,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54da9a096/f7256d9b0cf94f08ba2c1b4677161d7a/FLAG7b7a367d4 [2020-11-07 05:21:22,538 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:21:22,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-11-07 05:21:22,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54da9a096/f7256d9b0cf94f08ba2c1b4677161d7a/FLAG7b7a367d4 [2020-11-07 05:21:22,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54da9a096/f7256d9b0cf94f08ba2c1b4677161d7a [2020-11-07 05:21:22,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:21:22,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:21:22,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:22,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:21:22,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:21:22,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:22" (1/1) ... [2020-11-07 05:21:22,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c86ec56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:22, skipping insertion in model container [2020-11-07 05:21:22,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:22" (1/1) ... [2020-11-07 05:21:22,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:21:22,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:21:23,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:23,134 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:21:23,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:23,364 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:21:23,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23 WrapperNode [2020-11-07 05:21:23,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:23,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:21:23,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:21:23,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:21:23,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (1/1) ... [2020-11-07 05:21:23,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (1/1) ... [2020-11-07 05:21:23,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (1/1) ... [2020-11-07 05:21:23,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (1/1) ... [2020-11-07 05:21:23,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (1/1) ... [2020-11-07 05:21:23,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (1/1) ... [2020-11-07 05:21:23,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (1/1) ... [2020-11-07 05:21:23,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:21:23,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:21:23,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:21:23,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:21:23,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:21:23,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:21:23,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:21:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:21:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-07 05:21:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-07 05:21:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-07 05:21:23,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:21:23,555 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:21:23,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:21:23,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 05:21:23,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 05:21:23,555 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:21:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:21:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:21:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-07 05:21:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-07 05:21:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-07 05:21:23,556 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-07 05:21:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-07 05:21:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-07 05:21:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-07 05:21:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-07 05:21:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-07 05:21:23,557 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-07 05:21:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-07 05:21:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-07 05:21:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-07 05:21:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-07 05:21:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-07 05:21:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-07 05:21:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-07 05:21:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-07 05:21:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-07 05:21:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-07 05:21:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-07 05:21:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-07 05:21:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-07 05:21:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-07 05:21:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-07 05:21:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-07 05:21:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-07 05:21:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-07 05:21:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-07 05:21:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-07 05:21:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-07 05:21:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-07 05:21:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-07 05:21:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-07 05:21:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-07 05:21:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-07 05:21:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-07 05:21:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-07 05:21:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-07 05:21:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-07 05:21:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-07 05:21:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-07 05:21:23,562 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-07 05:21:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-07 05:21:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-07 05:21:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-07 05:21:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-07 05:21:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-07 05:21:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-07 05:21:23,563 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-07 05:21:23,564 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-07 05:21:23,564 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-07 05:21:23,564 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 05:21:23,564 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 05:21:23,564 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-07 05:21:23,564 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 05:21:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-07 05:21:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-07 05:21:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-07 05:21:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-07 05:21:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-07 05:21:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-07 05:21:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-07 05:21:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-07 05:21:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-07 05:21:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-07 05:21:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-07 05:21:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-07 05:21:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-07 05:21:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-07 05:21:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-07 05:21:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-07 05:21:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-07 05:21:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-07 05:21:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-07 05:21:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-07 05:21:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-07 05:21:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-07 05:21:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-07 05:21:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-07 05:21:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-07 05:21:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-07 05:21:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-07 05:21:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-07 05:21:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-07 05:21:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-07 05:21:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-07 05:21:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-07 05:21:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-07 05:21:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-07 05:21:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-07 05:21:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-07 05:21:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-07 05:21:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-07 05:21:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-07 05:21:23,570 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-07 05:21:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-07 05:21:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-07 05:21:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-07 05:21:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-07 05:21:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-07 05:21:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-07 05:21:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-07 05:21:23,571 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-07 05:21:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-07 05:21:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:21:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 05:21:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:21:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:21:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:21:23,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:21:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:21:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:21:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:21:23,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:21:23,991 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-07 05:21:24,537 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:21:24,538 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-07 05:21:24,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:24 BoogieIcfgContainer [2020-11-07 05:21:24,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:21:24,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:21:24,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:21:24,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:21:24,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:21:22" (1/3) ... [2020-11-07 05:21:24,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535630ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:24, skipping insertion in model container [2020-11-07 05:21:24,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:23" (2/3) ... [2020-11-07 05:21:24,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535630ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:24, skipping insertion in model container [2020-11-07 05:21:24,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:24" (3/3) ... [2020-11-07 05:21:24,552 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-11-07 05:21:24,571 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:21:24,576 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:21:24,591 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:21:24,623 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:21:24,623 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:21:24,624 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:21:24,625 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:21:24,632 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:21:24,633 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:21:24,633 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:21:24,633 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:21:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2020-11-07 05:21:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-07 05:21:24,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:24,692 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] [2020-11-07 05:21:24,692 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1423555653, now seen corresponding path program 1 times [2020-11-07 05:21:24,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:24,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [236736123] [2020-11-07 05:21:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:25,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:25,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [236736123] [2020-11-07 05:21:25,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:25,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 05:21:25,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588199678] [2020-11-07 05:21:25,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 05:21:25,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:25,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 05:21:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 05:21:25,128 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 3 states. [2020-11-07 05:21:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:25,613 INFO L93 Difference]: Finished difference Result 354 states and 415 transitions. [2020-11-07 05:21:25,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 05:21:25,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-11-07 05:21:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:25,626 INFO L225 Difference]: With dead ends: 354 [2020-11-07 05:21:25,626 INFO L226 Difference]: Without dead ends: 172 [2020-11-07 05:21:25,632 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:21:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-07 05:21:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-11-07 05:21:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-11-07 05:21:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2020-11-07 05:21:25,694 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 37 [2020-11-07 05:21:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:25,694 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2020-11-07 05:21:25,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 05:21:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2020-11-07 05:21:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-07 05:21:25,698 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:25,698 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] [2020-11-07 05:21:25,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:21:25,699 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1825754480, now seen corresponding path program 1 times [2020-11-07 05:21:25,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:25,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1975776651] [2020-11-07 05:21:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:25,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:25,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1975776651] [2020-11-07 05:21:25,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:25,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-07 05:21:25,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815805683] [2020-11-07 05:21:25,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 05:21:25,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:25,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 05:21:25,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:21:25,838 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 5 states. [2020-11-07 05:21:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:26,330 INFO L93 Difference]: Finished difference Result 259 states and 285 transitions. [2020-11-07 05:21:26,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 05:21:26,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2020-11-07 05:21:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:26,336 INFO L225 Difference]: With dead ends: 259 [2020-11-07 05:21:26,336 INFO L226 Difference]: Without dead ends: 207 [2020-11-07 05:21:26,338 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:21:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-11-07 05:21:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2020-11-07 05:21:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-11-07 05:21:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2020-11-07 05:21:26,381 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 47 [2020-11-07 05:21:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:26,382 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2020-11-07 05:21:26,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 05:21:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2020-11-07 05:21:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:21:26,385 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:26,385 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:21:26,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:21:26,386 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:26,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1787311828, now seen corresponding path program 1 times [2020-11-07 05:21:26,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:26,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [34762121] [2020-11-07 05:21:26,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:26,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:26,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [34762121] [2020-11-07 05:21:26,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:26,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 05:21:26,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074064736] [2020-11-07 05:21:26,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:21:26,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:26,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:21:26,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:26,571 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand 7 states. [2020-11-07 05:21:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:27,457 INFO L93 Difference]: Finished difference Result 538 states and 604 transitions. [2020-11-07 05:21:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:21:27,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2020-11-07 05:21:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:27,466 INFO L225 Difference]: With dead ends: 538 [2020-11-07 05:21:27,466 INFO L226 Difference]: Without dead ends: 417 [2020-11-07 05:21:27,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-07 05:21:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 290. [2020-11-07 05:21:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-07 05:21:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 325 transitions. [2020-11-07 05:21:27,529 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 325 transitions. Word has length 60 [2020-11-07 05:21:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:27,530 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 325 transitions. [2020-11-07 05:21:27,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:21:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 325 transitions. [2020-11-07 05:21:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 05:21:27,534 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:27,534 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, 1, 1] [2020-11-07 05:21:27,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:21:27,535 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:27,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:27,535 INFO L82 PathProgramCache]: Analyzing trace with hash -534721967, now seen corresponding path program 1 times [2020-11-07 05:21:27,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:27,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1667587309] [2020-11-07 05:21:27,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:27,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:27,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1667587309] [2020-11-07 05:21:27,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:27,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 05:21:27,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685452927] [2020-11-07 05:21:27,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:21:27,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:27,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:21:27,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:27,685 INFO L87 Difference]: Start difference. First operand 290 states and 325 transitions. Second operand 7 states. [2020-11-07 05:21:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:28,374 INFO L93 Difference]: Finished difference Result 367 states and 409 transitions. [2020-11-07 05:21:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:21:28,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-11-07 05:21:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:28,380 INFO L225 Difference]: With dead ends: 367 [2020-11-07 05:21:28,380 INFO L226 Difference]: Without dead ends: 359 [2020-11-07 05:21:28,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:21:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-11-07 05:21:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 303. [2020-11-07 05:21:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-11-07 05:21:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 341 transitions. [2020-11-07 05:21:28,431 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 341 transitions. Word has length 62 [2020-11-07 05:21:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:28,432 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 341 transitions. [2020-11-07 05:21:28,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:21:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 341 transitions. [2020-11-07 05:21:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 05:21:28,435 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:28,435 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] [2020-11-07 05:21:28,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:21:28,436 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash 846185769, now seen corresponding path program 1 times [2020-11-07 05:21:28,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:28,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1149103132] [2020-11-07 05:21:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:28,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1149103132] [2020-11-07 05:21:28,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:28,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 05:21:28,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058431828] [2020-11-07 05:21:28,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:21:28,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:21:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:28,626 INFO L87 Difference]: Start difference. First operand 303 states and 341 transitions. Second operand 7 states. [2020-11-07 05:21:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:29,196 INFO L93 Difference]: Finished difference Result 370 states and 412 transitions. [2020-11-07 05:21:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:21:29,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-11-07 05:21:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:29,199 INFO L225 Difference]: With dead ends: 370 [2020-11-07 05:21:29,200 INFO L226 Difference]: Without dead ends: 353 [2020-11-07 05:21:29,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:21:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-11-07 05:21:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 300. [2020-11-07 05:21:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-11-07 05:21:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 337 transitions. [2020-11-07 05:21:29,256 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 337 transitions. Word has length 68 [2020-11-07 05:21:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:29,256 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 337 transitions. [2020-11-07 05:21:29,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:21:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 337 transitions. [2020-11-07 05:21:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 05:21:29,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:29,260 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] [2020-11-07 05:21:29,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:21:29,260 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash 664959833, now seen corresponding path program 1 times [2020-11-07 05:21:29,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:29,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903105050] [2020-11-07 05:21:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:29,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903105050] [2020-11-07 05:21:29,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:29,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 05:21:29,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645148438] [2020-11-07 05:21:29,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:21:29,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:29,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:21:29,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:29,408 INFO L87 Difference]: Start difference. First operand 300 states and 337 transitions. Second operand 7 states. [2020-11-07 05:21:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:29,977 INFO L93 Difference]: Finished difference Result 353 states and 393 transitions. [2020-11-07 05:21:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:21:29,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-11-07 05:21:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:29,980 INFO L225 Difference]: With dead ends: 353 [2020-11-07 05:21:29,981 INFO L226 Difference]: Without dead ends: 327 [2020-11-07 05:21:29,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:21:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-11-07 05:21:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 295. [2020-11-07 05:21:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-11-07 05:21:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 331 transitions. [2020-11-07 05:21:30,015 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 331 transitions. Word has length 68 [2020-11-07 05:21:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:30,015 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 331 transitions. [2020-11-07 05:21:30,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:21:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 331 transitions. [2020-11-07 05:21:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:21:30,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:30,017 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, 1, 1] [2020-11-07 05:21:30,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:21:30,018 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 41938962, now seen corresponding path program 1 times [2020-11-07 05:21:30,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:30,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [565464958] [2020-11-07 05:21:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:30,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [565464958] [2020-11-07 05:21:30,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:30,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:21:30,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374398939] [2020-11-07 05:21:30,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:21:30,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:30,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:21:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:21:30,349 INFO L87 Difference]: Start difference. First operand 295 states and 331 transitions. Second operand 15 states. [2020-11-07 05:21:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:31,526 INFO L93 Difference]: Finished difference Result 390 states and 433 transitions. [2020-11-07 05:21:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:21:31,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-11-07 05:21:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:31,529 INFO L225 Difference]: With dead ends: 390 [2020-11-07 05:21:31,529 INFO L226 Difference]: Without dead ends: 375 [2020-11-07 05:21:31,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:21:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-11-07 05:21:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 311. [2020-11-07 05:21:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-11-07 05:21:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 348 transitions. [2020-11-07 05:21:31,568 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 348 transitions. Word has length 73 [2020-11-07 05:21:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:31,570 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 348 transitions. [2020-11-07 05:21:31,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:21:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 348 transitions. [2020-11-07 05:21:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:21:31,573 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:31,573 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, 1, 1] [2020-11-07 05:21:31,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:21:31,573 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1285786464, now seen corresponding path program 1 times [2020-11-07 05:21:31,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:31,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [996735019] [2020-11-07 05:21:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:31,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:31,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [996735019] [2020-11-07 05:21:31,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:31,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:21:31,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512058279] [2020-11-07 05:21:31,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:21:31,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:31,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:21:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:21:31,909 INFO L87 Difference]: Start difference. First operand 311 states and 348 transitions. Second operand 15 states. [2020-11-07 05:21:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:33,300 INFO L93 Difference]: Finished difference Result 414 states and 460 transitions. [2020-11-07 05:21:33,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:21:33,301 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-11-07 05:21:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:33,304 INFO L225 Difference]: With dead ends: 414 [2020-11-07 05:21:33,304 INFO L226 Difference]: Without dead ends: 406 [2020-11-07 05:21:33,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:21:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-11-07 05:21:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 333. [2020-11-07 05:21:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-07 05:21:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 373 transitions. [2020-11-07 05:21:33,339 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 373 transitions. Word has length 73 [2020-11-07 05:21:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:33,340 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 373 transitions. [2020-11-07 05:21:33,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:21:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 373 transitions. [2020-11-07 05:21:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 05:21:33,341 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:33,341 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, 1, 1, 1, 1, 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:33,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:21:33,342 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash -287011750, now seen corresponding path program 1 times [2020-11-07 05:21:33,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:33,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705613544] [2020-11-07 05:21:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:33,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705613544] [2020-11-07 05:21:33,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:33,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:21:33,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810846161] [2020-11-07 05:21:33,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:21:33,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:33,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:21:33,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:33,938 INFO L87 Difference]: Start difference. First operand 333 states and 373 transitions. Second operand 17 states. [2020-11-07 05:21:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:35,761 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2020-11-07 05:21:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:21:35,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-11-07 05:21:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:35,765 INFO L225 Difference]: With dead ends: 398 [2020-11-07 05:21:35,766 INFO L226 Difference]: Without dead ends: 390 [2020-11-07 05:21:35,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:21:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2020-11-07 05:21:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 337. [2020-11-07 05:21:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2020-11-07 05:21:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 377 transitions. [2020-11-07 05:21:35,811 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 377 transitions. Word has length 79 [2020-11-07 05:21:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:35,811 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 377 transitions. [2020-11-07 05:21:35,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:21:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 377 transitions. [2020-11-07 05:21:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 05:21:35,819 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:35,819 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, 1, 1, 1, 1, 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:35,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:21:35,819 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:35,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:35,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1637564152, now seen corresponding path program 1 times [2020-11-07 05:21:35,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:35,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1831829006] [2020-11-07 05:21:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:36,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:36,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1831829006] [2020-11-07 05:21:36,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:36,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:21:36,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304770852] [2020-11-07 05:21:36,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:21:36,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:36,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:21:36,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:36,346 INFO L87 Difference]: Start difference. First operand 337 states and 377 transitions. Second operand 17 states. [2020-11-07 05:21:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:38,242 INFO L93 Difference]: Finished difference Result 412 states and 457 transitions. [2020-11-07 05:21:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:21:38,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-11-07 05:21:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:38,245 INFO L225 Difference]: With dead ends: 412 [2020-11-07 05:21:38,245 INFO L226 Difference]: Without dead ends: 404 [2020-11-07 05:21:38,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:21:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-11-07 05:21:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 346. [2020-11-07 05:21:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-11-07 05:21:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 387 transitions. [2020-11-07 05:21:38,291 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 387 transitions. Word has length 79 [2020-11-07 05:21:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:38,291 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 387 transitions. [2020-11-07 05:21:38,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:21:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 387 transitions. [2020-11-07 05:21:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-07 05:21:38,293 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:38,293 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, 1, 1, 1, 1, 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:38,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:21:38,293 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:38,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1456338216, now seen corresponding path program 1 times [2020-11-07 05:21:38,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:38,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1440472668] [2020-11-07 05:21:38,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:38,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:38,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1440472668] [2020-11-07 05:21:38,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:38,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:21:38,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834472461] [2020-11-07 05:21:38,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:21:38,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:38,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:21:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:21:38,625 INFO L87 Difference]: Start difference. First operand 346 states and 387 transitions. Second operand 15 states. [2020-11-07 05:21:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:40,008 INFO L93 Difference]: Finished difference Result 429 states and 476 transitions. [2020-11-07 05:21:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:21:40,008 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-11-07 05:21:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:40,011 INFO L225 Difference]: With dead ends: 429 [2020-11-07 05:21:40,011 INFO L226 Difference]: Without dead ends: 408 [2020-11-07 05:21:40,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:21:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2020-11-07 05:21:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 346. [2020-11-07 05:21:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2020-11-07 05:21:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 386 transitions. [2020-11-07 05:21:40,054 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 386 transitions. Word has length 79 [2020-11-07 05:21:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:40,054 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 386 transitions. [2020-11-07 05:21:40,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:21:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 386 transitions. [2020-11-07 05:21:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-07 05:21:40,056 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:40,056 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:40,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:21:40,057 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2023053233, now seen corresponding path program 2 times [2020-11-07 05:21:40,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:40,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002971997] [2020-11-07 05:21:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:40,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:40,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002971997] [2020-11-07 05:21:40,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:40,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:21:40,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279481531] [2020-11-07 05:21:40,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:21:40,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:40,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:21:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:21:40,606 INFO L87 Difference]: Start difference. First operand 346 states and 386 transitions. Second operand 22 states. [2020-11-07 05:21:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:43,407 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2020-11-07 05:21:43,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-07 05:21:43,408 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2020-11-07 05:21:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:43,412 INFO L225 Difference]: With dead ends: 434 [2020-11-07 05:21:43,412 INFO L226 Difference]: Without dead ends: 426 [2020-11-07 05:21:43,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=493, Invalid=2263, Unknown=0, NotChecked=0, Total=2756 [2020-11-07 05:21:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-11-07 05:21:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 371. [2020-11-07 05:21:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-11-07 05:21:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 413 transitions. [2020-11-07 05:21:43,461 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 413 transitions. Word has length 84 [2020-11-07 05:21:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:43,461 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 413 transitions. [2020-11-07 05:21:43,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:21:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 413 transitions. [2020-11-07 05:21:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-07 05:21:43,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:43,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:43,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:21:43,464 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:43,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1909669795, now seen corresponding path program 1 times [2020-11-07 05:21:43,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:43,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [788492313] [2020-11-07 05:21:43,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:44,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [788492313] [2020-11-07 05:21:44,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:44,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:21:44,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200647090] [2020-11-07 05:21:44,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:21:44,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:44,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:21:44,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:21:44,008 INFO L87 Difference]: Start difference. First operand 371 states and 413 transitions. Second operand 22 states. [2020-11-07 05:21:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:46,724 INFO L93 Difference]: Finished difference Result 471 states and 522 transitions. [2020-11-07 05:21:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-07 05:21:46,725 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2020-11-07 05:21:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:46,728 INFO L225 Difference]: With dead ends: 471 [2020-11-07 05:21:46,728 INFO L226 Difference]: Without dead ends: 463 [2020-11-07 05:21:46,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=459, Invalid=2193, Unknown=0, NotChecked=0, Total=2652 [2020-11-07 05:21:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2020-11-07 05:21:46,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 383. [2020-11-07 05:21:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-07 05:21:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 426 transitions. [2020-11-07 05:21:46,780 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 426 transitions. Word has length 84 [2020-11-07 05:21:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:46,780 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 426 transitions. [2020-11-07 05:21:46,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:21:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 426 transitions. [2020-11-07 05:21:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-07 05:21:46,782 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:46,782 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] [2020-11-07 05:21:46,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:21:46,782 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash 938613874, now seen corresponding path program 1 times [2020-11-07 05:21:46,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:46,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2094590613] [2020-11-07 05:21:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:47,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:47,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2094590613] [2020-11-07 05:21:47,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:47,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:21:47,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73560576] [2020-11-07 05:21:47,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:21:47,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:47,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:21:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:47,307 INFO L87 Difference]: Start difference. First operand 383 states and 426 transitions. Second operand 17 states. [2020-11-07 05:21:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:49,098 INFO L93 Difference]: Finished difference Result 441 states and 489 transitions. [2020-11-07 05:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:21:49,099 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-11-07 05:21:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:49,102 INFO L225 Difference]: With dead ends: 441 [2020-11-07 05:21:49,102 INFO L226 Difference]: Without dead ends: 424 [2020-11-07 05:21:49,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:21:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-11-07 05:21:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 385. [2020-11-07 05:21:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2020-11-07 05:21:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 428 transitions. [2020-11-07 05:21:49,149 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 428 transitions. Word has length 85 [2020-11-07 05:21:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:49,149 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 428 transitions. [2020-11-07 05:21:49,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:21:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 428 transitions. [2020-11-07 05:21:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-07 05:21:49,151 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:49,151 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2020-11-07 05:21:49,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:21:49,152 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash 757387938, now seen corresponding path program 2 times [2020-11-07 05:21:49,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:49,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [234126851] [2020-11-07 05:21:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:49,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:49,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [234126851] [2020-11-07 05:21:49,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:49,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:21:49,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638077848] [2020-11-07 05:21:49,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:21:49,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:21:49,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:49,605 INFO L87 Difference]: Start difference. First operand 385 states and 428 transitions. Second operand 17 states. [2020-11-07 05:21:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:51,271 INFO L93 Difference]: Finished difference Result 424 states and 470 transitions. [2020-11-07 05:21:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:21:51,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-11-07 05:21:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:51,275 INFO L225 Difference]: With dead ends: 424 [2020-11-07 05:21:51,275 INFO L226 Difference]: Without dead ends: 392 [2020-11-07 05:21:51,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:21:51,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-11-07 05:21:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 374. [2020-11-07 05:21:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-11-07 05:21:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 416 transitions. [2020-11-07 05:21:51,326 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 416 transitions. Word has length 85 [2020-11-07 05:21:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:51,326 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 416 transitions. [2020-11-07 05:21:51,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:21:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 416 transitions. [2020-11-07 05:21:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-07 05:21:51,328 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:51,329 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2020-11-07 05:21:51,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:21:51,329 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash 91480208, now seen corresponding path program 2 times [2020-11-07 05:21:51,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:51,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883086484] [2020-11-07 05:21:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:51,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883086484] [2020-11-07 05:21:51,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:51,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:21:51,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453019691] [2020-11-07 05:21:51,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:21:51,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:21:51,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:51,807 INFO L87 Difference]: Start difference. First operand 374 states and 416 transitions. Second operand 17 states. [2020-11-07 05:21:53,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:53,603 INFO L93 Difference]: Finished difference Result 414 states and 458 transitions. [2020-11-07 05:21:53,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:21:53,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-11-07 05:21:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:53,606 INFO L225 Difference]: With dead ends: 414 [2020-11-07 05:21:53,606 INFO L226 Difference]: Without dead ends: 386 [2020-11-07 05:21:53,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:21:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2020-11-07 05:21:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 362. [2020-11-07 05:21:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-11-07 05:21:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 403 transitions. [2020-11-07 05:21:53,652 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 403 transitions. Word has length 85 [2020-11-07 05:21:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:53,652 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 403 transitions. [2020-11-07 05:21:53,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:21:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 403 transitions. [2020-11-07 05:21:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 05:21:53,654 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:53,654 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 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:53,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:21:53,654 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:53,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:53,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1222429321, now seen corresponding path program 1 times [2020-11-07 05:21:53,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:53,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [170067174] [2020-11-07 05:21:53,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:54,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:54,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [170067174] [2020-11-07 05:21:54,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:54,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:21:54,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138248402] [2020-11-07 05:21:54,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:21:54,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:54,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:21:54,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:21:54,209 INFO L87 Difference]: Start difference. First operand 362 states and 403 transitions. Second operand 22 states. [2020-11-07 05:21:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:56,856 INFO L93 Difference]: Finished difference Result 440 states and 487 transitions. [2020-11-07 05:21:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-07 05:21:56,857 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2020-11-07 05:21:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:56,860 INFO L225 Difference]: With dead ends: 440 [2020-11-07 05:21:56,860 INFO L226 Difference]: Without dead ends: 423 [2020-11-07 05:21:56,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=451, Invalid=2099, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 05:21:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-11-07 05:21:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 378. [2020-11-07 05:21:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-11-07 05:21:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 420 transitions. [2020-11-07 05:21:56,909 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 420 transitions. Word has length 90 [2020-11-07 05:21:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:56,910 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 420 transitions. [2020-11-07 05:21:56,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:21:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 420 transitions. [2020-11-07 05:21:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 05:21:56,911 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:56,912 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 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:56,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:21:56,912 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1041203385, now seen corresponding path program 3 times [2020-11-07 05:21:56,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:56,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [809105019] [2020-11-07 05:21:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:57,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:57,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [809105019] [2020-11-07 05:21:57,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:57,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 05:21:57,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732894252] [2020-11-07 05:21:57,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 05:21:57,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:57,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 05:21:57,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:21:57,945 INFO L87 Difference]: Start difference. First operand 378 states and 420 transitions. Second operand 25 states. [2020-11-07 05:21:59,312 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-11-07 05:22:00,137 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-11-07 05:22:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:01,658 INFO L93 Difference]: Finished difference Result 441 states and 488 transitions. [2020-11-07 05:22:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-11-07 05:22:01,659 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2020-11-07 05:22:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:01,662 INFO L225 Difference]: With dead ends: 441 [2020-11-07 05:22:01,662 INFO L226 Difference]: Without dead ends: 426 [2020-11-07 05:22:01,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=490, Invalid=2590, Unknown=0, NotChecked=0, Total=3080 [2020-11-07 05:22:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-11-07 05:22:01,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 387. [2020-11-07 05:22:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-11-07 05:22:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 429 transitions. [2020-11-07 05:22:01,722 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 429 transitions. Word has length 90 [2020-11-07 05:22:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:01,722 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 429 transitions. [2020-11-07 05:22:01,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 05:22:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 429 transitions. [2020-11-07 05:22:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 05:22:01,724 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:01,724 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] [2020-11-07 05:22:01,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:22:01,725 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:01,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1635087611, now seen corresponding path program 1 times [2020-11-07 05:22:01,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:01,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249166210] [2020-11-07 05:22:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:22:01,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:22:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:22:01,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:22:01,819 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:22:01,819 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:22:01,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 05:22:01,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:22:01 BoogieIcfgContainer [2020-11-07 05:22:01,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:22:01,948 INFO L168 Benchmark]: Toolchain (without parser) took 39203.06 ms. Allocated memory was 155.2 MB in the beginning and 421.5 MB in the end (delta: 266.3 MB). Free memory was 138.4 MB in the beginning and 183.7 MB in the end (delta: -45.3 MB). Peak memory consumption was 220.8 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:01,949 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 155.2 MB. Free memory was 129.9 MB in the beginning and 129.7 MB in the end (delta: 141.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:22:01,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.75 ms. Allocated memory is still 155.2 MB. Free memory was 137.8 MB in the beginning and 129.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:01,950 INFO L168 Benchmark]: Boogie Preprocessor took 77.81 ms. Allocated memory is still 155.2 MB. Free memory was 129.3 MB in the beginning and 126.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:01,951 INFO L168 Benchmark]: RCFGBuilder took 1096.40 ms. Allocated memory is still 155.2 MB. Free memory was 125.8 MB in the beginning and 105.9 MB in the end (delta: 19.8 MB). Peak memory consumption was 37.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:01,954 INFO L168 Benchmark]: TraceAbstraction took 37404.47 ms. Allocated memory was 155.2 MB in the beginning and 421.5 MB in the end (delta: 266.3 MB). Free memory was 105.4 MB in the beginning and 183.7 MB in the end (delta: -78.3 MB). Peak memory consumption was 188.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:01,961 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.28 ms. Allocated memory is still 155.2 MB. Free memory was 129.9 MB in the beginning and 129.7 MB in the end (delta: 141.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 612.75 ms. Allocated memory is still 155.2 MB. Free memory was 137.8 MB in the beginning and 129.3 MB in the end (delta: 8.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 77.81 ms. Allocated memory is still 155.2 MB. Free memory was 129.3 MB in the beginning and 126.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1096.40 ms. Allocated memory is still 155.2 MB. Free memory was 125.8 MB in the beginning and 105.9 MB in the end (delta: 19.8 MB). Peak memory consumption was 37.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 37404.47 ms. Allocated memory was 155.2 MB in the beginning and 421.5 MB in the end (delta: 266.3 MB). Free memory was 105.4 MB in the beginning and 183.7 MB in the end (delta: -78.3 MB). Peak memory consumption was 188.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L553] root->left = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L554] root->right = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L555] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, malloc(sizeof(*root))={-1:0}, root={-1:0}] [L574] n = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L575] struct TreeNode* pred; VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L576] COND TRUE \read(*root) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L577] pred = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, pred={0:0}, root={-1:0}] [L578] n = root VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L579] EXPR n->left VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, pred={0:0}, root={-1:0}] [L579] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, pred={0:0}, root={-1:0}] [L579] EXPR n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L579] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L579] COND FALSE !(n->left || n->right) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L586] COND FALSE !(\read(*pred)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L592] root = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L576] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L595] List a = (List) malloc(sizeof(struct node)); VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L596] COND FALSE !(a == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L597] List t; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L598] List p = a; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L599] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L600] p->h = 1 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L601] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L602] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L603] p->n = t VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L604] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L604] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L599] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L606] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L607] p->h = 2 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L608] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L609] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L610] p->n = t VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L611] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->n={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L611] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-4:0}, p->n={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L613] p->h = 3 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L614] p = a VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-4:0}] [L615] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L615] COND FALSE !(p->h == 2) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L617] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L617] COND TRUE p->h == 1 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L618] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L618] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L617] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L617] COND FALSE !(p->h == 1) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L619] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L619] COND TRUE p->h != 3 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L620] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list_and_tree_cnstr-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 37.2s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3345 SDtfs, 5932 SDslu, 27385 SDs, 0 SdLazy, 12467 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2768 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 879 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1310 ConstructedInterpolants, 0 QuantifiedInterpolants, 646113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 42/119 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...