/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:21:38,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:21:38,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:21:38,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:21:38,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:21:38,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:21:38,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:21:38,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:21:38,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:21:38,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:21:38,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:21:38,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:21:38,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:21:39,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:21:39,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:21:39,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:21:39,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:21:39,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:21:39,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:21:39,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:21:39,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:21:39,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:21:39,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:21:39,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:21:39,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:21:39,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:21:39,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:21:39,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:21:39,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:21:39,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:21:39,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:21:39,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:21:39,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:21:39,067 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:21:39,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:21:39,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:21:39,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:21:39,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:21:39,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:21:39,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:21:39,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:21:39,086 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:39,105 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:21:39,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:21:39,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:21:39,110 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:21:39,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:21:39,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:21:39,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:21:39,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:21:39,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:21:39,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:21:39,113 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:21:39,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:21:39,114 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:21:39,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:21:39,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:21:39,115 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:21:39,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:21:39,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:21:39,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:21:39,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:21:39,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:21:39,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:21:39,117 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:39,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:21:39,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:21:39,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:21:39,580 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:21:39,581 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:21:39,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-11-07 05:21:39,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/734ab88a5/d7b24b7b802c463f94e77d2774a3868e/FLAGb2d38bada [2020-11-07 05:21:40,397 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:21:40,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check-1.i [2020-11-07 05:21:40,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/734ab88a5/d7b24b7b802c463f94e77d2774a3868e/FLAGb2d38bada [2020-11-07 05:21:40,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/734ab88a5/d7b24b7b802c463f94e77d2774a3868e [2020-11-07 05:21:40,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:21:40,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:21:40,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:40,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:21:40,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:21:40,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6414f8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:40, skipping insertion in model container [2020-11-07 05:21:40,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:21:40" (1/1) ... [2020-11-07 05:21:40,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:21:40,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:21:41,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:41,301 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:21:41,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:21:41,482 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:21:41,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:41 WrapperNode [2020-11-07 05:21:41,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:21:41,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:21:41,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:21:41,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:21:41,498 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:41" (1/1) ... [2020-11-07 05:21:41,499 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:41" (1/1) ... [2020-11-07 05:21:41,533 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:41" (1/1) ... [2020-11-07 05:21:41,534 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:41" (1/1) ... [2020-11-07 05:21:41,573 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:41" (1/1) ... [2020-11-07 05:21:41,583 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:41" (1/1) ... [2020-11-07 05:21:41,592 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:41" (1/1) ... [2020-11-07 05:21:41,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:21:41,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:21:41,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:21:41,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:21:41,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:41" (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:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:21:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:21:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:21:41,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-11-07 05:21:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-11-07 05:21:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-11-07 05:21:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2020-11-07 05:21:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2020-11-07 05:21:41,692 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2020-11-07 05:21:41,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:21:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:21:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:21:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 05:21:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 05:21:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:21:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:21:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:21:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-11-07 05:21:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-11-07 05:21:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-11-07 05:21:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-11-07 05:21:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-11-07 05:21:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-11-07 05:21:41,695 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-11-07 05:21:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-11-07 05:21:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-11-07 05:21:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-11-07 05:21:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-11-07 05:21:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-11-07 05:21:41,696 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-11-07 05:21:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-11-07 05:21:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-11-07 05:21:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-11-07 05:21:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-11-07 05:21:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-11-07 05:21:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-11-07 05:21:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-11-07 05:21:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-11-07 05:21:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-11-07 05:21:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-11-07 05:21:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-11-07 05:21:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-11-07 05:21:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-11-07 05:21:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-11-07 05:21:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-11-07 05:21:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-11-07 05:21:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-11-07 05:21:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-11-07 05:21:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-11-07 05:21:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-11-07 05:21:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-11-07 05:21:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-11-07 05:21:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-11-07 05:21:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-11-07 05:21:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-11-07 05:21:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-11-07 05:21:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-11-07 05:21:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-11-07 05:21:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-11-07 05:21:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-11-07 05:21:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-11-07 05:21:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-11-07 05:21:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-11-07 05:21:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-11-07 05:21:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-11-07 05:21:41,702 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-11-07 05:21:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-11-07 05:21:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-11-07 05:21:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-11-07 05:21:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 05:21:41,703 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 05:21:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-07 05:21:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 05:21:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-07 05:21:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-11-07 05:21:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-07 05:21:41,704 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-11-07 05:21:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-11-07 05:21:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-11-07 05:21:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-11-07 05:21:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-11-07 05:21:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-07 05:21:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-11-07 05:21:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-11-07 05:21:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-11-07 05:21:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-11-07 05:21:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-11-07 05:21:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-11-07 05:21:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-11-07 05:21:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-11-07 05:21:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-11-07 05:21:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-11-07 05:21:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-11-07 05:21:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-11-07 05:21:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-11-07 05:21:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-11-07 05:21:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-11-07 05:21:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-11-07 05:21:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-11-07 05:21:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-11-07 05:21:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-11-07 05:21:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-11-07 05:21:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-11-07 05:21:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-11-07 05:21:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-11-07 05:21:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-11-07 05:21:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-11-07 05:21:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-11-07 05:21:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-11-07 05:21:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-11-07 05:21:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-11-07 05:21:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-11-07 05:21:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-11-07 05:21:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-11-07 05:21:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-11-07 05:21:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-11-07 05:21:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-11-07 05:21:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-11-07 05:21:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-11-07 05:21:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-11-07 05:21:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-11-07 05:21:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-11-07 05:21:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2020-11-07 05:21:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 05:21:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:21:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2020-11-07 05:21:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:21:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2020-11-07 05:21:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:21:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:21:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:21:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:21:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:21:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:21:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:21:42,278 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-11-07 05:21:42,502 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:21:42,502 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-07 05:21:42,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:42 BoogieIcfgContainer [2020-11-07 05:21:42,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:21:42,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:21:42,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:21:42,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:21:42,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:21:40" (1/3) ... [2020-11-07 05:21:42,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0f555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:42, skipping insertion in model container [2020-11-07 05:21:42,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:21:41" (2/3) ... [2020-11-07 05:21:42,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0f555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:21:42, skipping insertion in model container [2020-11-07 05:21:42,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:21:42" (3/3) ... [2020-11-07 05:21:42,513 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2020-11-07 05:21:42,527 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:21:42,531 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:21:42,543 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:21:42,565 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:21:42,566 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:21:42,566 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:21:42,566 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:21:42,566 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:21:42,566 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:21:42,566 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:21:42,567 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:21:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2020-11-07 05:21:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-07 05:21:42,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:42,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:42,593 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:42,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1821326867, now seen corresponding path program 1 times [2020-11-07 05:21:42,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:42,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599122790] [2020-11-07 05:21:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:42,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:42,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:21:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:42,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-07 05:21:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:42,945 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:42,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599122790] [2020-11-07 05:21:42,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:42,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 05:21:42,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326052021] [2020-11-07 05:21:42,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 05:21:42,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:42,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 05:21:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 05:21:42,983 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2020-11-07 05:21:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:43,586 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2020-11-07 05:21:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 05:21:43,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-11-07 05:21:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:43,598 INFO L225 Difference]: With dead ends: 165 [2020-11-07 05:21:43,599 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 05:21:43,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 05:21:43,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 05:21:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 05:21:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 05:21:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2020-11-07 05:21:43,660 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 35 [2020-11-07 05:21:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:43,661 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2020-11-07 05:21:43,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 05:21:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2020-11-07 05:21:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-07 05:21:43,663 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:43,664 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] [2020-11-07 05:21:43,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:21:43,664 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:43,665 INFO L82 PathProgramCache]: Analyzing trace with hash 937008902, now seen corresponding path program 1 times [2020-11-07 05:21:43,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:43,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1916253230] [2020-11-07 05:21:43,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 05:21:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-11-07 05:21:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:43,891 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:43,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1916253230] [2020-11-07 05:21:43,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:43,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:21:43,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032728318] [2020-11-07 05:21:43,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:21:43,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:21:43,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:21:43,896 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 6 states. [2020-11-07 05:21:44,450 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-07 05:21:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:44,820 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2020-11-07 05:21:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:21:44,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-11-07 05:21:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:44,823 INFO L225 Difference]: With dead ends: 148 [2020-11-07 05:21:44,823 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 05:21:44,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:21:44,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 05:21:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2020-11-07 05:21:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 05:21:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2020-11-07 05:21:44,844 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 39 [2020-11-07 05:21:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:44,844 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2020-11-07 05:21:44,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:21:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-11-07 05:21:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 05:21:44,846 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:44,846 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] [2020-11-07 05:21:44,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:21:44,847 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:44,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:44,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1587017737, now seen corresponding path program 1 times [2020-11-07 05:21:44,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:44,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364519374] [2020-11-07 05:21:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:44,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:44,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:21:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:21:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:45,044 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:45,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1364519374] [2020-11-07 05:21:45,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:45,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 05:21:45,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214417454] [2020-11-07 05:21:45,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:21:45,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:45,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:21:45,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:21:45,047 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 7 states. [2020-11-07 05:21:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:45,833 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2020-11-07 05:21:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:21:45,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-11-07 05:21:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:45,841 INFO L225 Difference]: With dead ends: 120 [2020-11-07 05:21:45,842 INFO L226 Difference]: Without dead ends: 98 [2020-11-07 05:21:45,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-07 05:21:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2020-11-07 05:21:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-07 05:21:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2020-11-07 05:21:45,869 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 41 [2020-11-07 05:21:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:45,870 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2020-11-07 05:21:45,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:21:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2020-11-07 05:21:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 05:21:45,873 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:45,873 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] [2020-11-07 05:21:45,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:21:45,874 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2090405153, now seen corresponding path program 1 times [2020-11-07 05:21:45,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:45,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1249895167] [2020-11-07 05:21:45,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-07 05:21:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-07 05:21:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:46,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:46,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1249895167] [2020-11-07 05:21:46,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:46,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:21:46,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38189103] [2020-11-07 05:21:46,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:21:46,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:46,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:21:46,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:21:46,085 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 8 states. [2020-11-07 05:21:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:47,385 INFO L93 Difference]: Finished difference Result 172 states and 190 transitions. [2020-11-07 05:21:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:21:47,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2020-11-07 05:21:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:47,390 INFO L225 Difference]: With dead ends: 172 [2020-11-07 05:21:47,390 INFO L226 Difference]: Without dead ends: 119 [2020-11-07 05:21:47,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:21:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-07 05:21:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 80. [2020-11-07 05:21:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 05:21:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2020-11-07 05:21:47,414 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 49 [2020-11-07 05:21:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:47,414 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2020-11-07 05:21:47,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:21:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2020-11-07 05:21:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-07 05:21:47,416 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:47,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:47,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:21:47,417 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:47,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:47,418 INFO L82 PathProgramCache]: Analyzing trace with hash 475045390, now seen corresponding path program 1 times [2020-11-07 05:21:47,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:47,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1912948296] [2020-11-07 05:21:47,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:47,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:47,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:21:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:47,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-07 05:21:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:47,729 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:47,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1912948296] [2020-11-07 05:21:47,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:21:47,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 05:21:47,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150215056] [2020-11-07 05:21:47,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:21:47,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:47,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:21:47,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:21:47,732 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 12 states. [2020-11-07 05:21:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:48,947 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-11-07 05:21:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:21:48,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2020-11-07 05:21:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:48,952 INFO L225 Difference]: With dead ends: 108 [2020-11-07 05:21:48,953 INFO L226 Difference]: Without dead ends: 101 [2020-11-07 05:21:48,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:21:48,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-07 05:21:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2020-11-07 05:21:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 05:21:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2020-11-07 05:21:48,979 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 50 [2020-11-07 05:21:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:48,979 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2020-11-07 05:21:48,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:21:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-11-07 05:21:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-07 05:21:48,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:48,984 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:21:48,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:21:48,984 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash -65029726, now seen corresponding path program 1 times [2020-11-07 05:21:48,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:48,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271052849] [2020-11-07 05:21:48,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:49,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:49,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:21:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:49,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-11-07 05:21:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:49,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271052849] [2020-11-07 05:21:49,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:49,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:21:49,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894772248] [2020-11-07 05:21:49,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:21:49,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:49,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:21:49,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:21:49,186 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 9 states. [2020-11-07 05:21:50,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:50,346 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2020-11-07 05:21:50,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:21:50,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-11-07 05:21:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:50,349 INFO L225 Difference]: With dead ends: 148 [2020-11-07 05:21:50,350 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 05:21:50,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:21:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 05:21:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2020-11-07 05:21:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-11-07 05:21:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2020-11-07 05:21:50,404 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 51 [2020-11-07 05:21:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:50,405 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2020-11-07 05:21:50,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:21:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2020-11-07 05:21:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:21:50,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:50,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:50,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:21:50,412 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:50,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1343250501, now seen corresponding path program 1 times [2020-11-07 05:21:50,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:50,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1218683517] [2020-11-07 05:21:50,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:21:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-07 05:21:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:50,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1218683517] [2020-11-07 05:21:50,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:50,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:21:50,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814671071] [2020-11-07 05:21:50,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:21:50,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:50,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:21:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:21:50,667 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 9 states. [2020-11-07 05:21:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:51,598 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2020-11-07 05:21:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:21:51,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2020-11-07 05:21:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:51,601 INFO L225 Difference]: With dead ends: 149 [2020-11-07 05:21:51,601 INFO L226 Difference]: Without dead ends: 123 [2020-11-07 05:21:51,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:21:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-07 05:21:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2020-11-07 05:21:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-11-07 05:21:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2020-11-07 05:21:51,628 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 57 [2020-11-07 05:21:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:51,628 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2020-11-07 05:21:51,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:21:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2020-11-07 05:21:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 05:21:51,630 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:51,631 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-07 05:21:51,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:21:51,631 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:51,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:51,632 INFO L82 PathProgramCache]: Analyzing trace with hash -561771656, now seen corresponding path program 2 times [2020-11-07 05:21:51,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:51,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371011912] [2020-11-07 05:21:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-07 05:21:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:21:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:51,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371011912] [2020-11-07 05:21:51,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:51,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:21:51,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914154724] [2020-11-07 05:21:51,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:21:51,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:51,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:21:51,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:21:51,879 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 10 states. [2020-11-07 05:21:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:53,483 INFO L93 Difference]: Finished difference Result 226 states and 255 transitions. [2020-11-07 05:21:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:21:53,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2020-11-07 05:21:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:53,489 INFO L225 Difference]: With dead ends: 226 [2020-11-07 05:21:53,489 INFO L226 Difference]: Without dead ends: 154 [2020-11-07 05:21:53,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:21:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-11-07 05:21:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 112. [2020-11-07 05:21:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 05:21:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2020-11-07 05:21:53,524 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 59 [2020-11-07 05:21:53,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:53,524 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2020-11-07 05:21:53,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:21:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2020-11-07 05:21:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:21:53,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:53,526 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:53,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:21:53,527 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash 72945659, now seen corresponding path program 2 times [2020-11-07 05:21:53,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:53,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1732939615] [2020-11-07 05:21:53,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:21:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-07 05:21:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:53,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1732939615] [2020-11-07 05:21:53,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:53,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:21:53,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307931549] [2020-11-07 05:21:53,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:21:53,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:53,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:21:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:53,782 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 11 states. [2020-11-07 05:21:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:55,353 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2020-11-07 05:21:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:21:55,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2020-11-07 05:21:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:55,356 INFO L225 Difference]: With dead ends: 149 [2020-11-07 05:21:55,356 INFO L226 Difference]: Without dead ends: 117 [2020-11-07 05:21:55,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:21:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-07 05:21:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2020-11-07 05:21:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 05:21:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2020-11-07 05:21:55,384 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 61 [2020-11-07 05:21:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:55,385 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2020-11-07 05:21:55,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:21:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2020-11-07 05:21:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 05:21:55,386 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:55,386 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:21:55,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:21:55,387 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:55,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1225942080, now seen corresponding path program 2 times [2020-11-07 05:21:55,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:55,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132107916] [2020-11-07 05:21:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:55,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:55,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:21:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:55,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:21:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:21:55,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1132107916] [2020-11-07 05:21:55,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:55,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:21:55,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271639401] [2020-11-07 05:21:55,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:21:55,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:55,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:21:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:21:55,941 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand 17 states. [2020-11-07 05:21:57,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:57,914 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2020-11-07 05:21:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:21:57,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2020-11-07 05:21:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:57,916 INFO L225 Difference]: With dead ends: 134 [2020-11-07 05:21:57,916 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 05:21:57,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:21:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 05:21:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2020-11-07 05:21:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-07 05:21:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2020-11-07 05:21:57,949 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 66 [2020-11-07 05:21:57,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:57,951 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2020-11-07 05:21:57,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:21:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2020-11-07 05:21:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 05:21:57,955 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:57,955 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:21:57,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:21:57,955 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1520758956, now seen corresponding path program 1 times [2020-11-07 05:21:57,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:57,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [135421783] [2020-11-07 05:21:57,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:58,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:58,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:21:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:58,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-11-07 05:21:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:21:58,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [135421783] [2020-11-07 05:21:58,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:58,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:21:58,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850750543] [2020-11-07 05:21:58,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:21:58,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:58,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:21:58,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:58,240 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 11 states. [2020-11-07 05:21:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:21:59,398 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2020-11-07 05:21:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:21:59,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2020-11-07 05:21:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:21:59,402 INFO L225 Difference]: With dead ends: 170 [2020-11-07 05:21:59,402 INFO L226 Difference]: Without dead ends: 137 [2020-11-07 05:21:59,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:21:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-07 05:21:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 113. [2020-11-07 05:21:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-07 05:21:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2020-11-07 05:21:59,432 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 67 [2020-11-07 05:21:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:21:59,433 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2020-11-07 05:21:59,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:21:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2020-11-07 05:21:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:21:59,434 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:21:59,434 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:21:59,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:21:59,434 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:21:59,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:21:59,435 INFO L82 PathProgramCache]: Analyzing trace with hash -239258167, now seen corresponding path program 3 times [2020-11-07 05:21:59,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:21:59,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675730085] [2020-11-07 05:21:59,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:21:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:59,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:21:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:59,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:21:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:59,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:21:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:21:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 05:21:59,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675730085] [2020-11-07 05:21:59,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:21:59,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:21:59,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24386868] [2020-11-07 05:21:59,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:21:59,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:21:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:21:59,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:21:59,704 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 11 states. [2020-11-07 05:22:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:00,586 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2020-11-07 05:22:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:22:00,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2020-11-07 05:22:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:00,591 INFO L225 Difference]: With dead ends: 175 [2020-11-07 05:22:00,591 INFO L226 Difference]: Without dead ends: 142 [2020-11-07 05:22:00,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:22:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-07 05:22:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2020-11-07 05:22:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-11-07 05:22:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2020-11-07 05:22:00,618 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 73 [2020-11-07 05:22:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:00,619 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2020-11-07 05:22:00,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:22:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2020-11-07 05:22:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 05:22:00,620 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:00,620 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:00,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:22:00,621 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash 926323629, now seen corresponding path program 2 times [2020-11-07 05:22:00,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:00,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526838050] [2020-11-07 05:22:00,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:00,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:00,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:22:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:00,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-11-07 05:22:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 05:22:00,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526838050] [2020-11-07 05:22:00,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:00,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:22:00,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864613673] [2020-11-07 05:22:00,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:22:00,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:22:00,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:22:00,928 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand 13 states. [2020-11-07 05:22:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:02,560 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2020-11-07 05:22:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:22:02,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2020-11-07 05:22:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:02,563 INFO L225 Difference]: With dead ends: 172 [2020-11-07 05:22:02,563 INFO L226 Difference]: Without dead ends: 133 [2020-11-07 05:22:02,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:22:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-11-07 05:22:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2020-11-07 05:22:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-11-07 05:22:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2020-11-07 05:22:02,587 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 77 [2020-11-07 05:22:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:02,588 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2020-11-07 05:22:02,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:22:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2020-11-07 05:22:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-07 05:22:02,589 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:02,589 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:02,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:22:02,589 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash 680822734, now seen corresponding path program 4 times [2020-11-07 05:22:02,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:02,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [199622678] [2020-11-07 05:22:02,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:02,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:02,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:22:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:02,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2020-11-07 05:22:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-07 05:22:02,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [199622678] [2020-11-07 05:22:02,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:02,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:22:02,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220245541] [2020-11-07 05:22:02,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:22:02,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:22:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:22:02,946 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 12 states. [2020-11-07 05:22:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:04,423 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-11-07 05:22:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:22:04,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2020-11-07 05:22:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:04,426 INFO L225 Difference]: With dead ends: 142 [2020-11-07 05:22:04,426 INFO L226 Difference]: Without dead ends: 135 [2020-11-07 05:22:04,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:22:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-07 05:22:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2020-11-07 05:22:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-07 05:22:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2020-11-07 05:22:04,453 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 82 [2020-11-07 05:22:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:04,454 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2020-11-07 05:22:04,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:22:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2020-11-07 05:22:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-07 05:22:04,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:04,455 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:22:04,456 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1913629854, now seen corresponding path program 3 times [2020-11-07 05:22:04,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:04,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283671744] [2020-11-07 05:22:04,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:04,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:22:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:04,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 05:22:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:04,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 05:22:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:22:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 05:22:04,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283671744] [2020-11-07 05:22:04,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:22:04,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:22:04,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984648828] [2020-11-07 05:22:04,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:22:04,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:22:04,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:22:04,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:22:04,762 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 13 states. [2020-11-07 05:22:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:22:06,184 INFO L93 Difference]: Finished difference Result 190 states and 204 transitions. [2020-11-07 05:22:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:22:06,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2020-11-07 05:22:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:22:06,188 INFO L225 Difference]: With dead ends: 190 [2020-11-07 05:22:06,188 INFO L226 Difference]: Without dead ends: 150 [2020-11-07 05:22:06,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:22:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-11-07 05:22:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2020-11-07 05:22:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-07 05:22:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2020-11-07 05:22:06,217 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 83 [2020-11-07 05:22:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:22:06,218 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2020-11-07 05:22:06,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:22:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2020-11-07 05:22:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 05:22:06,219 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:22:06,220 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:22:06,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:22:06,220 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:22:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:22:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1123729925, now seen corresponding path program 5 times [2020-11-07 05:22:06,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:22:06,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [422816106] [2020-11-07 05:22:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:22:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:22:06,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:22:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:22:06,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:22:06,321 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:22:06,323 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:22:06,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:22:06,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:22:06 BoogieIcfgContainer [2020-11-07 05:22:06,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:22:06,441 INFO L168 Benchmark]: Toolchain (without parser) took 25795.64 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 133.7 MB in the beginning and 174.6 MB in the end (delta: -40.9 MB). Peak memory consumption was 39.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:06,441 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 125.2 MB in the end (delta: 136.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:22:06,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.96 ms. Allocated memory is still 151.0 MB. Free memory was 133.1 MB in the beginning and 122.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:06,448 INFO L168 Benchmark]: Boogie Preprocessor took 122.25 ms. Allocated memory is still 151.0 MB. Free memory was 122.8 MB in the beginning and 120.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:06,451 INFO L168 Benchmark]: RCFGBuilder took 897.13 ms. Allocated memory is still 151.0 MB. Free memory was 120.4 MB in the beginning and 121.1 MB in the end (delta: -702.3 kB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:06,451 INFO L168 Benchmark]: TraceAbstraction took 23933.28 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 121.1 MB in the beginning and 174.6 MB in the end (delta: -53.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. [2020-11-07 05:22:06,455 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.29 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 125.2 MB in the end (delta: 136.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 827.96 ms. Allocated memory is still 151.0 MB. Free memory was 133.1 MB in the beginning and 122.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 122.25 ms. Allocated memory is still 151.0 MB. Free memory was 122.8 MB in the beginning and 120.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 897.13 ms. Allocated memory is still 151.0 MB. Free memory was 120.4 MB in the beginning and 121.1 MB in the end (delta: -702.3 kB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23933.28 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 121.1 MB in the beginning and 174.6 MB in the end (delta: -53.4 MB). Peak memory consumption was 27.8 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: [L603] int len = 2; VAL [len=2] [L604] len < 32 && __VERIFIER_nondet_int() VAL [len=2, len < 32 && __VERIFIER_nondet_int()=1] [L604] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L604] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L607] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L575] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L576] COND TRUE len > 0 VAL [\old(len)=3, head={0:0}, len=3] [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L581] new_head->next = head VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L582] head = new_head VAL [\old(len)=3, head={-1:0}, len=3, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L583] len-- VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L576] COND TRUE len > 0 VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-1:0}, new_head={-1:0}] [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L581] new_head->next = head VAL [\old(len)=3, head={-1:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L582] head = new_head VAL [\old(len)=3, head={-2:0}, len=2, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L583] len-- VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L576] COND TRUE len > 0 VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-2:0}, new_head={-2:0}] [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L578] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L581] new_head->next = head VAL [\old(len)=3, head={-2:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L582] head = new_head VAL [\old(len)=3, head={-3:0}, len=1, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L583] len-- VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L576] COND FALSE !(len > 0) VAL [\old(len)=3, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L585] return head; VAL [\old(len)=3, \result={-3:0}, head={-3:0}, len=0, malloc(sizeof(struct node))={-3:0}, new_head={-3:0}] [L607] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={-3:0}] [L607] SLL s = sll_create(len + 1); VAL [len=2, s={-3:0}, sll_create(len + 1)={-3:0}] [L608] CALL, EXPR sll_length(s) VAL [head={-3:0}] [L588] int len = 0; VAL [head={-3:0}, head={-3:0}, len=0] [L589] COND TRUE \read(head) VAL [head={-3:0}, head={-3:0}, len=0] [L590] len++ VAL [head={-3:0}, head={-3:0}, len=1] [L591] EXPR head->next VAL [head={-3:0}, head={-3:0}, head->next={-2:0}, len=1] [L591] head = head->next VAL [head={-3:0}, head={-2:0}, head->next={-2:0}, len=1] [L589] COND TRUE \read(head) VAL [head={-2:0}, head={-3:0}, len=1] [L590] len++ VAL [head={-2:0}, head={-3:0}, len=2] [L591] EXPR head->next VAL [head={-2:0}, head={-3:0}, head->next={-1:0}, len=2] [L591] head = head->next VAL [head={-3:0}, head={-1:0}, head->next={-1:0}, len=2] [L589] COND TRUE \read(head) VAL [head={-3:0}, head={-1:0}, len=2] [L590] len++ VAL [head={-1:0}, head={-3:0}, len=3] [L591] EXPR head->next VAL [head={-1:0}, head={-3:0}, head->next={0:0}, len=3] [L591] head = head->next VAL [head={-3:0}, head={0:0}, head->next={0:0}, len=3] [L589] COND FALSE !(\read(head)) VAL [head={0:0}, head={-3:0}, len=3] [L593] return len; VAL [\result=3, head={-3:0}, head={0:0}, len=3] [L608] RET, EXPR sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L608] COND TRUE len != sll_length(s) VAL [len=2, s={-3:0}, sll_length(s)=3] [L613] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_length_check-1.c", 3, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.7s, OverallIterations: 16, TraceHistogramMax: 3, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1036 SDtfs, 2216 SDslu, 2780 SDs, 0 SdLazy, 5526 SolverSat, 441 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 328 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 157214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 70/172 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...