java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:47:13,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:47:13,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:47:13,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:47:13,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:47:13,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:47:13,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:47:13,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:47:13,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:47:13,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:47:13,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:47:13,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:47:13,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:47:13,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:47:13,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:47:13,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:47:13,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:47:13,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:47:13,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:47:13,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:47:13,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:47:13,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:47:13,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:47:13,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:47:13,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:47:13,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:47:13,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:47:13,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:47:13,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:47:13,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:47:13,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:47:13,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:47:13,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:47:13,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:47:13,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:47:13,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:47:13,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:47:13,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:47:13,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:47:13,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:47:13,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:47:13,436 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:47:13,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:47:13,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:47:13,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:47:13,452 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:47:13,452 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:47:13,452 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:47:13,453 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:47:13,453 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:47:13,453 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:47:13,453 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:47:13,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:47:13,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:47:13,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:47:13,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:47:13,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:47:13,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:47:13,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:47:13,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:47:13,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:47:13,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:47:13,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:47:13,456 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:47:13,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:47:13,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:47:13,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:47:13,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:47:13,457 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:47:13,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:47:13,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:47:13,458 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:47:13,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:47:13,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:47:13,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:47:13,530 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:47:13,530 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:47:13,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2019-09-10 01:47:13,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0544450/7dcac73a8c6d47179ca1183577368233/FLAG61b59734f [2019-09-10 01:47:14,145 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:47:14,145 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2019-09-10 01:47:14,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0544450/7dcac73a8c6d47179ca1183577368233/FLAG61b59734f [2019-09-10 01:47:14,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0544450/7dcac73a8c6d47179ca1183577368233 [2019-09-10 01:47:14,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:47:14,398 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:47:14,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:47:14,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:47:14,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:47:14,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:47:14" (1/1) ... [2019-09-10 01:47:14,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6501343a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:14, skipping insertion in model container [2019-09-10 01:47:14,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:47:14" (1/1) ... [2019-09-10 01:47:14,415 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:47:14,478 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:47:14,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:47:14,954 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:47:15,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:47:15,048 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:47:15,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15 WrapperNode [2019-09-10 01:47:15,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:47:15,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:47:15,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:47:15,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:47:15,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (1/1) ... [2019-09-10 01:47:15,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:47:15,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:47:15,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:47:15,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:47:15,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (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 [2019-09-10 01:47:15,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:47:15,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:47:15,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:47:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-10 01:47:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-10 01:47:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-10 01:47:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-10 01:47:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-10 01:47:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-10 01:47:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-10 01:47:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-10 01:47:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-10 01:47:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-10 01:47:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-10 01:47:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-10 01:47:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-10 01:47:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-10 01:47:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-10 01:47:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-10 01:47:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-10 01:47:15,211 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-10 01:47:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-10 01:47:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-10 01:47:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-10 01:47:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-10 01:47:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-10 01:47:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-10 01:47:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-10 01:47:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-10 01:47:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-10 01:47:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-10 01:47:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-10 01:47:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-10 01:47:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-10 01:47:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-10 01:47:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-10 01:47:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-10 01:47:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-10 01:47:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-10 01:47:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-10 01:47:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-10 01:47:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-10 01:47:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-10 01:47:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-10 01:47:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-10 01:47:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-10 01:47:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-10 01:47:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-10 01:47:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-10 01:47:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-10 01:47:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-10 01:47:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-10 01:47:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-10 01:47:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 01:47:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-10 01:47:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-10 01:47:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 01:47:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-10 01:47:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-10 01:47:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-10 01:47:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-10 01:47:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-10 01:47:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-10 01:47:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-10 01:47:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-10 01:47:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-10 01:47:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 01:47:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-10 01:47:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-10 01:47:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-10 01:47:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-10 01:47:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-10 01:47:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-10 01:47:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-10 01:47:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-10 01:47:15,223 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-10 01:47:15,223 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-10 01:47:15,223 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-10 01:47:15,223 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-10 01:47:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-10 01:47:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-10 01:47:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-10 01:47:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-10 01:47:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-10 01:47:15,224 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-10 01:47:15,225 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-10 01:47:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-10 01:47:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-10 01:47:15,226 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-10 01:47:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-10 01:47:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-10 01:47:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-10 01:47:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-10 01:47:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-10 01:47:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-10 01:47:15,227 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-10 01:47:15,228 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-10 01:47:15,228 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-10 01:47:15,228 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-10 01:47:15,228 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-10 01:47:15,228 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-10 01:47:15,228 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-10 01:47:15,228 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-10 01:47:15,228 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-10 01:47:15,229 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-10 01:47:15,229 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-10 01:47:15,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 01:47:15,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:47:15,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:47:15,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 01:47:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 01:47:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 01:47:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 01:47:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:47:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:47:15,936 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:47:15,936 INFO L283 CfgBuilder]: Removed 30 assume(true) statements. [2019-09-10 01:47:15,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:47:15 BoogieIcfgContainer [2019-09-10 01:47:15,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:47:15,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:47:15,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:47:15,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:47:15,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:47:14" (1/3) ... [2019-09-10 01:47:15,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c51da21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:47:15, skipping insertion in model container [2019-09-10 01:47:15,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:47:15" (2/3) ... [2019-09-10 01:47:15,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c51da21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:47:15, skipping insertion in model container [2019-09-10 01:47:15,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:47:15" (3/3) ... [2019-09-10 01:47:15,946 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2019-09-10 01:47:15,956 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:47:15,964 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-09-10 01:47:15,981 INFO L252 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-09-10 01:47:16,008 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:47:16,009 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:47:16,009 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:47:16,009 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:47:16,010 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:47:16,010 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:47:16,010 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:47:16,011 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:47:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-09-10 01:47:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-09-10 01:47:16,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:16,047 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:16,049 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:16,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1849702252, now seen corresponding path program 1 times [2019-09-10 01:47:16,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:16,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:16,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:16,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:16,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:16,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:16,245 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2019-09-10 01:47:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:16,309 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-09-10 01:47:16,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:16,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-09-10 01:47:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:16,323 INFO L225 Difference]: With dead ends: 91 [2019-09-10 01:47:16,324 INFO L226 Difference]: Without dead ends: 86 [2019-09-10 01:47:16,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-10 01:47:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2019-09-10 01:47:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 01:47:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-09-10 01:47:16,370 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 8 [2019-09-10 01:47:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:16,370 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-09-10 01:47:16,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-09-10 01:47:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:47:16,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:16,371 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:16,372 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash 175176272, now seen corresponding path program 1 times [2019-09-10 01:47:16,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:16,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:16,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:16,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:16,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:16,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:16,476 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 4 states. [2019-09-10 01:47:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:16,642 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2019-09-10 01:47:16,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:47:16,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-10 01:47:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:16,644 INFO L225 Difference]: With dead ends: 119 [2019-09-10 01:47:16,645 INFO L226 Difference]: Without dead ends: 119 [2019-09-10 01:47:16,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-10 01:47:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-09-10 01:47:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-10 01:47:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2019-09-10 01:47:16,657 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 13 [2019-09-10 01:47:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:16,658 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2019-09-10 01:47:16,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2019-09-10 01:47:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:47:16,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:16,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:16,661 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:16,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:16,662 INFO L82 PathProgramCache]: Analyzing trace with hash 175178194, now seen corresponding path program 1 times [2019-09-10 01:47:16,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:16,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:16,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:16,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:16,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:16,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:16,783 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand 4 states. [2019-09-10 01:47:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:16,925 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2019-09-10 01:47:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:47:16,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-10 01:47:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:16,928 INFO L225 Difference]: With dead ends: 118 [2019-09-10 01:47:16,928 INFO L226 Difference]: Without dead ends: 118 [2019-09-10 01:47:16,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-10 01:47:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 74. [2019-09-10 01:47:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-10 01:47:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-09-10 01:47:16,936 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 13 [2019-09-10 01:47:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:16,937 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-09-10 01:47:16,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-09-10 01:47:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 01:47:16,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:16,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:16,938 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 177025236, now seen corresponding path program 1 times [2019-09-10 01:47:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:16,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:17,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:17,020 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 4 states. [2019-09-10 01:47:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,108 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-09-10 01:47:17,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:47:17,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-10 01:47:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,110 INFO L225 Difference]: With dead ends: 72 [2019-09-10 01:47:17,110 INFO L226 Difference]: Without dead ends: 72 [2019-09-10 01:47:17,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-10 01:47:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-10 01:47:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-10 01:47:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2019-09-10 01:47:17,124 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 13 [2019-09-10 01:47:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,125 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2019-09-10 01:47:17,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2019-09-10 01:47:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:47:17,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:17,129 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1699413030, now seen corresponding path program 1 times [2019-09-10 01:47:17,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:17,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:17,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:17,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,210 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand 3 states. [2019-09-10 01:47:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,251 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2019-09-10 01:47:17,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:17,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-10 01:47:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,252 INFO L225 Difference]: With dead ends: 69 [2019-09-10 01:47:17,253 INFO L226 Difference]: Without dead ends: 69 [2019-09-10 01:47:17,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-10 01:47:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-10 01:47:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-10 01:47:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-09-10 01:47:17,259 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 17 [2019-09-10 01:47:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,259 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-09-10 01:47:17,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-09-10 01:47:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:47:17,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:17,261 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1142192178, now seen corresponding path program 1 times [2019-09-10 01:47:17,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:47:17,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:47:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:47:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:17,350 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 5 states. [2019-09-10 01:47:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,439 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2019-09-10 01:47:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:47:17,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 01:47:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,441 INFO L225 Difference]: With dead ends: 99 [2019-09-10 01:47:17,441 INFO L226 Difference]: Without dead ends: 99 [2019-09-10 01:47:17,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:47:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-10 01:47:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 65. [2019-09-10 01:47:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-10 01:47:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2019-09-10 01:47:17,447 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 18 [2019-09-10 01:47:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,447 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2019-09-10 01:47:17,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:47:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2019-09-10 01:47:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:47:17,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:47:17,449 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1989453493, now seen corresponding path program 1 times [2019-09-10 01:47:17,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:17,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:17,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,518 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 3 states. [2019-09-10 01:47:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,541 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-09-10 01:47:17,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:17,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-10 01:47:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,543 INFO L225 Difference]: With dead ends: 85 [2019-09-10 01:47:17,543 INFO L226 Difference]: Without dead ends: 85 [2019-09-10 01:47:17,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-10 01:47:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2019-09-10 01:47:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 01:47:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2019-09-10 01:47:17,552 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 21 [2019-09-10 01:47:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,552 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2019-09-10 01:47:17,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2019-09-10 01:47:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:47:17,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,557 INFO L399 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] [2019-09-10 01:47:17,558 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1543505685, now seen corresponding path program 1 times [2019-09-10 01:47:17,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:17,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:17,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,624 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 3 states. [2019-09-10 01:47:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,644 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-09-10 01:47:17,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:17,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-10 01:47:17,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,646 INFO L225 Difference]: With dead ends: 66 [2019-09-10 01:47:17,646 INFO L226 Difference]: Without dead ends: 66 [2019-09-10 01:47:17,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-10 01:47:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-09-10 01:47:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-10 01:47:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2019-09-10 01:47:17,653 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 22 [2019-09-10 01:47:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,654 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2019-09-10 01:47:17,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2019-09-10 01:47:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 01:47:17,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,657 INFO L399 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] [2019-09-10 01:47:17,658 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash -550247973, now seen corresponding path program 1 times [2019-09-10 01:47:17,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:17,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:17,731 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand 4 states. [2019-09-10 01:47:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:17,809 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-10 01:47:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:47:17,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-10 01:47:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:17,811 INFO L225 Difference]: With dead ends: 65 [2019-09-10 01:47:17,811 INFO L226 Difference]: Without dead ends: 65 [2019-09-10 01:47:17,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-10 01:47:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-09-10 01:47:17,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-10 01:47:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-09-10 01:47:17,817 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 23 [2019-09-10 01:47:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:17,818 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-09-10 01:47:17,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-09-10 01:47:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:47:17,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:17,822 INFO L399 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] [2019-09-10 01:47:17,823 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:17,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:17,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1545385056, now seen corresponding path program 1 times [2019-09-10 01:47:17,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:17,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:17,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:17,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:17,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 01:47:17,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:17,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:47:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:47:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 01:47:17,975 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 6 states. [2019-09-10 01:47:18,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:18,261 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2019-09-10 01:47:18,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:47:18,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-09-10 01:47:18,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:18,263 INFO L225 Difference]: With dead ends: 135 [2019-09-10 01:47:18,263 INFO L226 Difference]: Without dead ends: 135 [2019-09-10 01:47:18,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:47:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-10 01:47:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 81. [2019-09-10 01:47:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-10 01:47:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2019-09-10 01:47:18,267 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 24 [2019-09-10 01:47:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:18,268 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2019-09-10 01:47:18,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:47:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2019-09-10 01:47:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:47:18,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:18,269 INFO L399 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] [2019-09-10 01:47:18,269 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1535433952, now seen corresponding path program 1 times [2019-09-10 01:47:18,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:18,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:18,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:18,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:18,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:18,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:18,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 01:47:18,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:18,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:47:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:47:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:47:18,536 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 9 states. [2019-09-10 01:47:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:19,243 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2019-09-10 01:47:19,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 01:47:19,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-10 01:47:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:19,246 INFO L225 Difference]: With dead ends: 172 [2019-09-10 01:47:19,246 INFO L226 Difference]: Without dead ends: 172 [2019-09-10 01:47:19,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-09-10 01:47:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-10 01:47:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 96. [2019-09-10 01:47:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-10 01:47:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2019-09-10 01:47:19,252 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2019-09-10 01:47:19,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:19,253 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2019-09-10 01:47:19,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:47:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2019-09-10 01:47:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:47:19,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:19,254 INFO L399 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] [2019-09-10 01:47:19,255 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:19,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:19,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1607903204, now seen corresponding path program 1 times [2019-09-10 01:47:19,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:19,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:19,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:19,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:19,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:47:19,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:19,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:47:19,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:47:19,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:47:19,301 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand 4 states. [2019-09-10 01:47:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:19,428 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2019-09-10 01:47:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:47:19,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-09-10 01:47:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:19,430 INFO L225 Difference]: With dead ends: 125 [2019-09-10 01:47:19,430 INFO L226 Difference]: Without dead ends: 125 [2019-09-10 01:47:19,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-10 01:47:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2019-09-10 01:47:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-10 01:47:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2019-09-10 01:47:19,434 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 26 [2019-09-10 01:47:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:19,434 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2019-09-10 01:47:19,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:47:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2019-09-10 01:47:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:47:19,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:19,436 INFO L399 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] [2019-09-10 01:47:19,436 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:19,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1713987740, now seen corresponding path program 1 times [2019-09-10 01:47:19,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:19,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:19,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:19,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:19,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:19,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:19,483 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand 3 states. [2019-09-10 01:47:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:19,518 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2019-09-10 01:47:19,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:19,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-10 01:47:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:19,521 INFO L225 Difference]: With dead ends: 115 [2019-09-10 01:47:19,521 INFO L226 Difference]: Without dead ends: 115 [2019-09-10 01:47:19,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-10 01:47:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-09-10 01:47:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-10 01:47:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2019-09-10 01:47:19,525 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 26 [2019-09-10 01:47:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:19,526 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2019-09-10 01:47:19,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2019-09-10 01:47:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:47:19,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:19,531 INFO L399 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] [2019-09-10 01:47:19,532 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:19,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1916582485, now seen corresponding path program 1 times [2019-09-10 01:47:19,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:19,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:19,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:19,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:19,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:19,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 01:47:19,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:19,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:47:19,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:47:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:47:19,840 INFO L87 Difference]: Start difference. First operand 115 states and 144 transitions. Second operand 9 states. [2019-09-10 01:47:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:20,492 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2019-09-10 01:47:20,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 01:47:20,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-10 01:47:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:20,494 INFO L225 Difference]: With dead ends: 189 [2019-09-10 01:47:20,494 INFO L226 Difference]: Without dead ends: 189 [2019-09-10 01:47:20,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-09-10 01:47:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-10 01:47:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 120. [2019-09-10 01:47:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-10 01:47:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2019-09-10 01:47:20,500 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 26 [2019-09-10 01:47:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:20,500 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2019-09-10 01:47:20,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:47:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2019-09-10 01:47:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:47:20,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:20,501 INFO L399 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] [2019-09-10 01:47:20,502 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash -130720279, now seen corresponding path program 1 times [2019-09-10 01:47:20,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:20,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:20,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:20,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:20,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:20,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:47:20,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:20,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:47:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:47:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:47:20,589 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 5 states. [2019-09-10 01:47:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:20,738 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2019-09-10 01:47:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:47:20,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-10 01:47:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:20,740 INFO L225 Difference]: With dead ends: 141 [2019-09-10 01:47:20,740 INFO L226 Difference]: Without dead ends: 141 [2019-09-10 01:47:20,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:47:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-10 01:47:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121. [2019-09-10 01:47:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-10 01:47:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-09-10 01:47:20,749 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 28 [2019-09-10 01:47:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:20,750 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-09-10 01:47:20,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:47:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-09-10 01:47:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:47:20,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:20,752 INFO L399 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] [2019-09-10 01:47:20,752 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:20,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2125081561, now seen corresponding path program 1 times [2019-09-10 01:47:20,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:20,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:20,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:20,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:20,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 01:47:20,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:20,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:47:20,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:47:20,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:47:20,925 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 7 states. [2019-09-10 01:47:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:21,143 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2019-09-10 01:47:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:47:21,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-10 01:47:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:21,144 INFO L225 Difference]: With dead ends: 180 [2019-09-10 01:47:21,144 INFO L226 Difference]: Without dead ends: 180 [2019-09-10 01:47:21,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 01:47:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-10 01:47:21,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136. [2019-09-10 01:47:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-10 01:47:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2019-09-10 01:47:21,149 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 28 [2019-09-10 01:47:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:21,149 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2019-09-10 01:47:21,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:47:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2019-09-10 01:47:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 01:47:21,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:21,150 INFO L399 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] [2019-09-10 01:47:21,151 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:21,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash -654056556, now seen corresponding path program 1 times [2019-09-10 01:47:21,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:21,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:21,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:21,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:47:21,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:47:21,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:21,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:47:21,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:47:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:21,175 INFO L87 Difference]: Start difference. First operand 136 states and 172 transitions. Second operand 3 states. [2019-09-10 01:47:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:21,200 INFO L93 Difference]: Finished difference Result 184 states and 226 transitions. [2019-09-10 01:47:21,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:47:21,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-10 01:47:21,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:21,201 INFO L225 Difference]: With dead ends: 184 [2019-09-10 01:47:21,201 INFO L226 Difference]: Without dead ends: 184 [2019-09-10 01:47:21,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:47:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-10 01:47:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2019-09-10 01:47:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-10 01:47:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 196 transitions. [2019-09-10 01:47:21,206 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 196 transitions. Word has length 30 [2019-09-10 01:47:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:21,206 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 196 transitions. [2019-09-10 01:47:21,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:47:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 196 transitions. [2019-09-10 01:47:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 01:47:21,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:47:21,207 INFO L399 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] [2019-09-10 01:47:21,208 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:47:21,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:21,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2125824226, now seen corresponding path program 1 times [2019-09-10 01:47:21,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:47:21,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:47:21,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:47:21,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:47:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:47:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:47:21,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:47:21,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 01:47:21,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2019-09-10 01:47:21,290 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [12], [24], [30], [35], [43], [57], [60], [132], [142], [156], [165], [245], [265], [268], [278], [289], [292], [293], [325], [327], [333], [334], [357], [370], [374], [375], [376] [2019-09-10 01:47:21,333 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:47:21,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:47:21,406 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 01:47:21,408 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 17 root evaluator evaluations with a maximum evaluation depth of 0. Performed 17 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 40 variables. [2019-09-10 01:47:21,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:47:21,415 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 01:47:21,467 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-10 01:47:21,467 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 01:47:21,469 INFO L420 sIntCurrentIteration]: We unified 30 AI predicates to 30 [2019-09-10 01:47:21,469 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 01:47:21,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 01:47:21,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 01:47:21,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:47:21,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:47:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:47:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:47:21,472 INFO L87 Difference]: Start difference. First operand 155 states and 196 transitions. Second operand 2 states. [2019-09-10 01:47:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:47:21,473 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-10 01:47:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:47:21,473 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 31 [2019-09-10 01:47:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:47:21,473 INFO L225 Difference]: With dead ends: 6 [2019-09-10 01:47:21,474 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:47:21,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:47:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:47:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:47:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:47:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:47:21,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-09-10 01:47:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:47:21,475 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:47:21,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:47:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:47:21,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:47:21,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:47:21 BoogieIcfgContainer [2019-09-10 01:47:21,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:47:21,486 INFO L168 Benchmark]: Toolchain (without parser) took 7086.13 ms. Allocated memory was 133.2 MB in the beginning and 308.3 MB in the end (delta: 175.1 MB). Free memory was 87.2 MB in the beginning and 163.9 MB in the end (delta: -76.7 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:47:21,491 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:47:21,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.29 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.0 MB in the beginning and 164.5 MB in the end (delta: -77.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:47:21,493 INFO L168 Benchmark]: Boogie Preprocessor took 76.34 ms. Allocated memory is still 200.3 MB. Free memory was 164.5 MB in the beginning and 161.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:47:21,493 INFO L168 Benchmark]: RCFGBuilder took 811.30 ms. Allocated memory is still 200.3 MB. Free memory was 161.2 MB in the beginning and 105.2 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:47:21,494 INFO L168 Benchmark]: TraceAbstraction took 5544.13 ms. Allocated memory was 200.3 MB in the beginning and 308.3 MB in the end (delta: 108.0 MB). Free memory was 105.2 MB in the beginning and 163.9 MB in the end (delta: -58.8 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:47:21,497 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 650.29 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 87.0 MB in the beginning and 164.5 MB in the end (delta: -77.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.34 ms. Allocated memory is still 200.3 MB. Free memory was 164.5 MB in the beginning and 161.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.30 ms. Allocated memory is still 200.3 MB. Free memory was 161.2 MB in the beginning and 105.2 MB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5544.13 ms. Allocated memory was 200.3 MB in the beginning and 308.3 MB in the end (delta: 108.0 MB). Free memory was 105.2 MB in the beginning and 163.9 MB in the end (delta: -58.8 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1044]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1031]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1025]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1026]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1004]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1043]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 993]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1045]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. SAFE Result, 5.4s OverallTime, 18 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1081 SDtfs, 1356 SDslu, 1698 SDs, 0 SdLazy, 1076 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9666666666666667 AbsIntWeakeningRatio, 1.3333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 0.2 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 460 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 70868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 3/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...