/usr/bin/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 22:07:57,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 22:07:57,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 22:07:57,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 22:07:57,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 22:07:57,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 22:07:57,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 22:07:57,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 22:07:57,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 22:07:57,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 22:07:57,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 22:07:57,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 22:07:57,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 22:07:57,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 22:07:57,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 22:07:57,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 22:07:57,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 22:07:57,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 22:07:57,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 22:07:57,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 22:07:57,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 22:07:57,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 22:07:57,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 22:07:57,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 22:07:57,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 22:07:57,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 22:07:57,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 22:07:57,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 22:07:57,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 22:07:57,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 22:07:57,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 22:07:57,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 22:07:57,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 22:07:57,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 22:07:57,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 22:07:57,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 22:07:57,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 22:07:57,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 22:07:57,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 22:07:57,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 22:07:57,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 22:07:57,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 22:07:57,556 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 22:07:57,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 22:07:57,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 22:07:57,559 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 22:07:57,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 22:07:57,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 22:07:57,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 22:07:57,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 22:07:57,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 22:07:57,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 22:07:57,560 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 22:07:57,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 22:07:57,560 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 22:07:57,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 22:07:57,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 22:07:57,561 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 22:07:57,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 22:07:57,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 22:07:57,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:07:57,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 22:07:57,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 22:07:57,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 22:07:57,563 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 22:07:58,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:07:58,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:07:58,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:07:58,074 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:07:58,075 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:07:58,076 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-09-04 22:07:58,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b227d7d7a/6c26578cc2c547daacb06c3bd5d2afd7/FLAG9f84309c3 [2020-09-04 22:07:58,942 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:07:58,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-09-04 22:07:58,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b227d7d7a/6c26578cc2c547daacb06c3bd5d2afd7/FLAG9f84309c3 [2020-09-04 22:07:59,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b227d7d7a/6c26578cc2c547daacb06c3bd5d2afd7 [2020-09-04 22:07:59,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:07:59,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:07:59,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:07:59,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:07:59,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:07:59,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:07:59" (1/1) ... [2020-09-04 22:07:59,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db9ac37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:07:59, skipping insertion in model container [2020-09-04 22:07:59,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:07:59" (1/1) ... [2020-09-04 22:07:59,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:07:59,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:07:59,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:07:59,915 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:08:00,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:08:00,119 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:08:00,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00 WrapperNode [2020-09-04 22:08:00,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:08:00,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:08:00,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:08:00,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:08:00,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (1/1) ... [2020-09-04 22:08:00,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (1/1) ... [2020-09-04 22:08:00,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (1/1) ... [2020-09-04 22:08:00,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (1/1) ... [2020-09-04 22:08:00,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (1/1) ... [2020-09-04 22:08:00,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (1/1) ... [2020-09-04 22:08:00,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (1/1) ... [2020-09-04 22:08:00,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:08:00,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:08:00,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:08:00,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:08:00,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:08:00,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:08:00,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:08:00,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-09-04 22:08:00,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-09-04 22:08:00,320 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-09-04 22:08:00,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:08:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:08:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:08:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-09-04 22:08:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-09-04 22:08:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-09-04 22:08:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-09-04 22:08:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-09-04 22:08:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-09-04 22:08:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-09-04 22:08:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-09-04 22:08:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-09-04 22:08:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-09-04 22:08:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-09-04 22:08:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-09-04 22:08:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-09-04 22:08:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-09-04 22:08:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-09-04 22:08:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-09-04 22:08:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-09-04 22:08:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-09-04 22:08:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-09-04 22:08:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-09-04 22:08:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-09-04 22:08:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-09-04 22:08:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-09-04 22:08:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-09-04 22:08:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-09-04 22:08:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-09-04 22:08:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-09-04 22:08:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-09-04 22:08:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-09-04 22:08:00,326 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-09-04 22:08:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-09-04 22:08:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-09-04 22:08:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-09-04 22:08:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-09-04 22:08:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-09-04 22:08:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-09-04 22:08:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-09-04 22:08:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-09-04 22:08:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-09-04 22:08:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-09-04 22:08:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-09-04 22:08:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-09-04 22:08:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-09-04 22:08:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-09-04 22:08:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-09-04 22:08:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-09-04 22:08:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-09-04 22:08:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-09-04 22:08:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-09-04 22:08:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-09-04 22:08:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-09-04 22:08:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-09-04 22:08:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-09-04 22:08:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 22:08:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-09-04 22:08:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 22:08:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-09-04 22:08:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-09-04 22:08:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-09-04 22:08:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-09-04 22:08:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-09-04 22:08:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 22:08:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-09-04 22:08:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-09-04 22:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-09-04 22:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-04 22:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-09-04 22:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-09-04 22:08:00,333 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-09-04 22:08:00,334 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-09-04 22:08:00,334 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-09-04 22:08:00,334 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-09-04 22:08:00,334 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-09-04 22:08:00,334 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-09-04 22:08:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-09-04 22:08:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-09-04 22:08:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-09-04 22:08:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-09-04 22:08:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-09-04 22:08:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-09-04 22:08:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-09-04 22:08:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-09-04 22:08:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-09-04 22:08:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-09-04 22:08:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-09-04 22:08:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-09-04 22:08:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-09-04 22:08:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-09-04 22:08:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-09-04 22:08:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-09-04 22:08:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-09-04 22:08:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-09-04 22:08:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-09-04 22:08:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-09-04 22:08:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-09-04 22:08:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-09-04 22:08:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-09-04 22:08:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-09-04 22:08:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-09-04 22:08:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-09-04 22:08:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-09-04 22:08:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-09-04 22:08:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-09-04 22:08:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-09-04 22:08:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-09-04 22:08:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-09-04 22:08:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:08:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 22:08:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-04 22:08:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-09-04 22:08:00,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 22:08:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 22:08:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 22:08:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:08:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:08:00,719 INFO L732 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-09-04 22:08:01,225 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:08:01,225 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-09-04 22:08:01,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:08:01 BoogieIcfgContainer [2020-09-04 22:08:01,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:08:01,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:08:01,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:08:01,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:08:01,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:07:59" (1/3) ... [2020-09-04 22:08:01,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a776e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:08:01, skipping insertion in model container [2020-09-04 22:08:01,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:08:00" (2/3) ... [2020-09-04 22:08:01,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a776e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:08:01, skipping insertion in model container [2020-09-04 22:08:01,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:08:01" (3/3) ... [2020-09-04 22:08:01,246 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-09-04 22:08:01,261 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:08:01,275 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:08:01,302 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:08:01,339 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:08:01,339 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:08:01,339 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:08:01,340 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:08:01,340 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:08:01,340 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:08:01,340 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:08:01,340 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:08:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states. [2020-09-04 22:08:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 22:08:01,390 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:01,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:01,393 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:01,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash -652445128, now seen corresponding path program 1 times [2020-09-04 22:08:01,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:01,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441233871] [2020-09-04 22:08:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:01,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:01,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [441233871] [2020-09-04 22:08:01,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:01,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:08:01,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797270918] [2020-09-04 22:08:01,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:08:01,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:08:01,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:08:01,757 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 3 states. [2020-09-04 22:08:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:02,281 INFO L93 Difference]: Finished difference Result 342 states and 400 transitions. [2020-09-04 22:08:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:08:02,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-09-04 22:08:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:02,301 INFO L225 Difference]: With dead ends: 342 [2020-09-04 22:08:02,302 INFO L226 Difference]: Without dead ends: 166 [2020-09-04 22:08:02,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:08:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-09-04 22:08:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2020-09-04 22:08:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-09-04 22:08:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 183 transitions. [2020-09-04 22:08:02,395 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 183 transitions. Word has length 31 [2020-09-04 22:08:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:02,396 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 183 transitions. [2020-09-04 22:08:02,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:08:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 183 transitions. [2020-09-04 22:08:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-04 22:08:02,400 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:02,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:02,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:08:02,401 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:02,402 INFO L82 PathProgramCache]: Analyzing trace with hash 473660712, now seen corresponding path program 1 times [2020-09-04 22:08:02,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:02,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [590405234] [2020-09-04 22:08:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:02,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:02,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:02,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [590405234] [2020-09-04 22:08:02,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:02,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 22:08:02,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383707123] [2020-09-04 22:08:02,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 22:08:02,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 22:08:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 22:08:02,663 INFO L87 Difference]: Start difference. First operand 166 states and 183 transitions. Second operand 5 states. [2020-09-04 22:08:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:03,163 INFO L93 Difference]: Finished difference Result 251 states and 277 transitions. [2020-09-04 22:08:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 22:08:03,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-09-04 22:08:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:03,171 INFO L225 Difference]: With dead ends: 251 [2020-09-04 22:08:03,171 INFO L226 Difference]: Without dead ends: 201 [2020-09-04 22:08:03,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 22:08:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-09-04 22:08:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2020-09-04 22:08:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-04 22:08:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2020-09-04 22:08:03,235 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 41 [2020-09-04 22:08:03,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:03,236 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2020-09-04 22:08:03,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 22:08:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2020-09-04 22:08:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 22:08:03,240 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:03,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:03,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:08:03,241 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1870874818, now seen corresponding path program 1 times [2020-09-04 22:08:03,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:03,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [652114326] [2020-09-04 22:08:03,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:03,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:08:03,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [652114326] [2020-09-04 22:08:03,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:03,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 22:08:03,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707432078] [2020-09-04 22:08:03,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 22:08:03,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:03,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 22:08:03,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 22:08:03,325 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand 4 states. [2020-09-04 22:08:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:03,704 INFO L93 Difference]: Finished difference Result 321 states and 359 transitions. [2020-09-04 22:08:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 22:08:03,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-09-04 22:08:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:03,707 INFO L225 Difference]: With dead ends: 321 [2020-09-04 22:08:03,707 INFO L226 Difference]: Without dead ends: 202 [2020-09-04 22:08:03,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 22:08:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-09-04 22:08:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2020-09-04 22:08:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-09-04 22:08:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 224 transitions. [2020-09-04 22:08:03,742 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 224 transitions. Word has length 54 [2020-09-04 22:08:03,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:03,743 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 224 transitions. [2020-09-04 22:08:03,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 22:08:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2020-09-04 22:08:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 22:08:03,745 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:03,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:03,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:08:03,746 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:03,747 INFO L82 PathProgramCache]: Analyzing trace with hash 129316031, now seen corresponding path program 1 times [2020-09-04 22:08:03,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:03,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348352540] [2020-09-04 22:08:03,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:03,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:03,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348352540] [2020-09-04 22:08:03,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:03,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 22:08:03,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280679544] [2020-09-04 22:08:03,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 22:08:03,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 22:08:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 22:08:03,908 INFO L87 Difference]: Start difference. First operand 202 states and 224 transitions. Second operand 7 states. [2020-09-04 22:08:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:04,431 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2020-09-04 22:08:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 22:08:04,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-09-04 22:08:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:04,437 INFO L225 Difference]: With dead ends: 279 [2020-09-04 22:08:04,437 INFO L226 Difference]: Without dead ends: 273 [2020-09-04 22:08:04,439 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:08:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-09-04 22:08:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 215. [2020-09-04 22:08:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-09-04 22:08:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 240 transitions. [2020-09-04 22:08:04,479 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 240 transitions. Word has length 56 [2020-09-04 22:08:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:04,480 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 240 transitions. [2020-09-04 22:08:04,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 22:08:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 240 transitions. [2020-09-04 22:08:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 22:08:04,483 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:04,483 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:04,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:08:04,484 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:04,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:04,484 INFO L82 PathProgramCache]: Analyzing trace with hash 593034583, now seen corresponding path program 1 times [2020-09-04 22:08:04,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:04,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [48042639] [2020-09-04 22:08:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:04,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:04,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [48042639] [2020-09-04 22:08:04,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:04,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 22:08:04,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038843577] [2020-09-04 22:08:04,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 22:08:04,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 22:08:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 22:08:04,637 INFO L87 Difference]: Start difference. First operand 215 states and 240 transitions. Second operand 7 states. [2020-09-04 22:08:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:05,223 INFO L93 Difference]: Finished difference Result 282 states and 309 transitions. [2020-09-04 22:08:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 22:08:05,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-09-04 22:08:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:05,226 INFO L225 Difference]: With dead ends: 282 [2020-09-04 22:08:05,226 INFO L226 Difference]: Without dead ends: 267 [2020-09-04 22:08:05,227 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:08:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2020-09-04 22:08:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 212. [2020-09-04 22:08:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-09-04 22:08:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 236 transitions. [2020-09-04 22:08:05,256 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 236 transitions. Word has length 62 [2020-09-04 22:08:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:05,261 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 236 transitions. [2020-09-04 22:08:05,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 22:08:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 236 transitions. [2020-09-04 22:08:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 22:08:05,264 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:05,264 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:05,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:08:05,265 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1629716359, now seen corresponding path program 1 times [2020-09-04 22:08:05,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:05,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053736413] [2020-09-04 22:08:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:05,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:05,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:05,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053736413] [2020-09-04 22:08:05,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:08:05,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 22:08:05,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058458395] [2020-09-04 22:08:05,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 22:08:05,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 22:08:05,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 22:08:05,449 INFO L87 Difference]: Start difference. First operand 212 states and 236 transitions. Second operand 7 states. [2020-09-04 22:08:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:05,955 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2020-09-04 22:08:05,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 22:08:05,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2020-09-04 22:08:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:05,959 INFO L225 Difference]: With dead ends: 264 [2020-09-04 22:08:05,959 INFO L226 Difference]: Without dead ends: 240 [2020-09-04 22:08:05,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-09-04 22:08:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-09-04 22:08:05,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 207. [2020-09-04 22:08:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-09-04 22:08:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2020-09-04 22:08:05,980 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 62 [2020-09-04 22:08:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:05,980 INFO L479 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2020-09-04 22:08:05,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 22:08:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2020-09-04 22:08:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 22:08:05,982 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:05,982 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:05,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:08:05,983 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash 852438762, now seen corresponding path program 1 times [2020-09-04 22:08:05,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:05,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1665387593] [2020-09-04 22:08:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:06,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:06,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1665387593] [2020-09-04 22:08:06,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:06,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 22:08:06,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545148260] [2020-09-04 22:08:06,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 22:08:06,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:06,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 22:08:06,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-04 22:08:06,300 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand 15 states. [2020-09-04 22:08:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:07,578 INFO L93 Difference]: Finished difference Result 302 states and 330 transitions. [2020-09-04 22:08:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 22:08:07,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-09-04 22:08:07,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:07,582 INFO L225 Difference]: With dead ends: 302 [2020-09-04 22:08:07,582 INFO L226 Difference]: Without dead ends: 289 [2020-09-04 22:08:07,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2020-09-04 22:08:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-09-04 22:08:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2020-09-04 22:08:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-09-04 22:08:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2020-09-04 22:08:07,611 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 67 [2020-09-04 22:08:07,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:07,612 INFO L479 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2020-09-04 22:08:07,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 22:08:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2020-09-04 22:08:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 22:08:07,614 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:07,614 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:07,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:08:07,615 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:07,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1742912072, now seen corresponding path program 1 times [2020-09-04 22:08:07,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:07,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1930862063] [2020-09-04 22:08:07,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:07,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:07,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1930862063] [2020-09-04 22:08:07,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:07,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 22:08:07,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826228289] [2020-09-04 22:08:07,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 22:08:07,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:07,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 22:08:07,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-04 22:08:07,995 INFO L87 Difference]: Start difference. First operand 223 states and 247 transitions. Second operand 15 states. [2020-09-04 22:08:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:09,283 INFO L93 Difference]: Finished difference Result 326 states and 357 transitions. [2020-09-04 22:08:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 22:08:09,284 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-09-04 22:08:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:09,286 INFO L225 Difference]: With dead ends: 326 [2020-09-04 22:08:09,287 INFO L226 Difference]: Without dead ends: 320 [2020-09-04 22:08:09,288 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2020-09-04 22:08:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-09-04 22:08:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 245. [2020-09-04 22:08:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-09-04 22:08:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 272 transitions. [2020-09-04 22:08:09,314 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 272 transitions. Word has length 67 [2020-09-04 22:08:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:09,316 INFO L479 AbstractCegarLoop]: Abstraction has 245 states and 272 transitions. [2020-09-04 22:08:09,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 22:08:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 272 transitions. [2020-09-04 22:08:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 22:08:09,317 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:09,318 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:09,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:08:09,318 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -838472334, now seen corresponding path program 1 times [2020-09-04 22:08:09,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:09,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1438297901] [2020-09-04 22:08:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:09,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:09,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1438297901] [2020-09-04 22:08:09,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:09,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:08:09,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145207660] [2020-09-04 22:08:09,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:08:09,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:08:09,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:08:09,934 INFO L87 Difference]: Start difference. First operand 245 states and 272 transitions. Second operand 17 states. [2020-09-04 22:08:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:11,668 INFO L93 Difference]: Finished difference Result 310 states and 340 transitions. [2020-09-04 22:08:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 22:08:11,670 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2020-09-04 22:08:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:11,673 INFO L225 Difference]: With dead ends: 310 [2020-09-04 22:08:11,674 INFO L226 Difference]: Without dead ends: 304 [2020-09-04 22:08:11,675 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 22:08:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-04 22:08:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 249. [2020-09-04 22:08:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-09-04 22:08:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 276 transitions. [2020-09-04 22:08:11,736 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 276 transitions. Word has length 73 [2020-09-04 22:08:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:11,737 INFO L479 AbstractCegarLoop]: Abstraction has 249 states and 276 transitions. [2020-09-04 22:08:11,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:08:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 276 transitions. [2020-09-04 22:08:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 22:08:11,739 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:11,739 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:11,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:08:11,740 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1654345840, now seen corresponding path program 1 times [2020-09-04 22:08:11,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:11,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [325683366] [2020-09-04 22:08:11,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:12,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:12,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [325683366] [2020-09-04 22:08:12,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:12,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:08:12,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763697572] [2020-09-04 22:08:12,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:08:12,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:08:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:08:12,347 INFO L87 Difference]: Start difference. First operand 249 states and 276 transitions. Second operand 17 states. [2020-09-04 22:08:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:14,173 INFO L93 Difference]: Finished difference Result 324 states and 354 transitions. [2020-09-04 22:08:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 22:08:14,174 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2020-09-04 22:08:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:14,177 INFO L225 Difference]: With dead ends: 324 [2020-09-04 22:08:14,177 INFO L226 Difference]: Without dead ends: 318 [2020-09-04 22:08:14,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 22:08:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-09-04 22:08:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 258. [2020-09-04 22:08:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-09-04 22:08:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 286 transitions. [2020-09-04 22:08:14,205 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 286 transitions. Word has length 73 [2020-09-04 22:08:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:14,205 INFO L479 AbstractCegarLoop]: Abstraction has 258 states and 286 transitions. [2020-09-04 22:08:14,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:08:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 286 transitions. [2020-09-04 22:08:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 22:08:14,207 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:14,207 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:14,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:08:14,208 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash -617664064, now seen corresponding path program 1 times [2020-09-04 22:08:14,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:14,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711791566] [2020-09-04 22:08:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:14,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:14,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711791566] [2020-09-04 22:08:14,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:14,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 22:08:14,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388576417] [2020-09-04 22:08:14,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 22:08:14,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:14,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 22:08:14,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-09-04 22:08:14,473 INFO L87 Difference]: Start difference. First operand 258 states and 286 transitions. Second operand 15 states. [2020-09-04 22:08:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:15,522 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2020-09-04 22:08:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 22:08:15,523 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-09-04 22:08:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:15,526 INFO L225 Difference]: With dead ends: 341 [2020-09-04 22:08:15,526 INFO L226 Difference]: Without dead ends: 322 [2020-09-04 22:08:15,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2020-09-04 22:08:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2020-09-04 22:08:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 258. [2020-09-04 22:08:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-09-04 22:08:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 285 transitions. [2020-09-04 22:08:15,554 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 285 transitions. Word has length 73 [2020-09-04 22:08:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:15,555 INFO L479 AbstractCegarLoop]: Abstraction has 258 states and 285 transitions. [2020-09-04 22:08:15,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 22:08:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 285 transitions. [2020-09-04 22:08:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 22:08:15,557 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:15,557 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:15,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 22:08:15,557 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:15,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash 342604767, now seen corresponding path program 2 times [2020-09-04 22:08:15,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:15,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1670346847] [2020-09-04 22:08:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:16,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:16,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1670346847] [2020-09-04 22:08:16,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:16,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 22:08:16,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127557028] [2020-09-04 22:08:16,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 22:08:16,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 22:08:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-09-04 22:08:16,142 INFO L87 Difference]: Start difference. First operand 258 states and 285 transitions. Second operand 22 states. [2020-09-04 22:08:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:18,583 INFO L93 Difference]: Finished difference Result 346 states and 378 transitions. [2020-09-04 22:08:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-09-04 22:08:18,583 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2020-09-04 22:08:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:18,586 INFO L225 Difference]: With dead ends: 346 [2020-09-04 22:08:18,586 INFO L226 Difference]: Without dead ends: 340 [2020-09-04 22:08:18,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=493, Invalid=2263, Unknown=0, NotChecked=0, Total=2756 [2020-09-04 22:08:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-09-04 22:08:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 283. [2020-09-04 22:08:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-09-04 22:08:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 312 transitions. [2020-09-04 22:08:18,619 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 312 transitions. Word has length 78 [2020-09-04 22:08:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:18,619 INFO L479 AbstractCegarLoop]: Abstraction has 283 states and 312 transitions. [2020-09-04 22:08:18,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 22:08:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 312 transitions. [2020-09-04 22:08:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-09-04 22:08:18,621 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:18,621 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:18,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 22:08:18,622 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1736898641, now seen corresponding path program 1 times [2020-09-04 22:08:18,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:18,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1086057193] [2020-09-04 22:08:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:19,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:19,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1086057193] [2020-09-04 22:08:19,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:19,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 22:08:19,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911946367] [2020-09-04 22:08:19,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 22:08:19,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:19,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 22:08:19,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-09-04 22:08:19,193 INFO L87 Difference]: Start difference. First operand 283 states and 312 transitions. Second operand 22 states. [2020-09-04 22:08:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:21,509 INFO L93 Difference]: Finished difference Result 383 states and 419 transitions. [2020-09-04 22:08:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-09-04 22:08:21,509 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2020-09-04 22:08:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:21,512 INFO L225 Difference]: With dead ends: 383 [2020-09-04 22:08:21,513 INFO L226 Difference]: Without dead ends: 377 [2020-09-04 22:08:21,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=459, Invalid=2193, Unknown=0, NotChecked=0, Total=2652 [2020-09-04 22:08:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-09-04 22:08:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 295. [2020-09-04 22:08:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-09-04 22:08:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 325 transitions. [2020-09-04 22:08:21,541 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 325 transitions. Word has length 78 [2020-09-04 22:08:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:21,542 INFO L479 AbstractCegarLoop]: Abstraction has 295 states and 325 transitions. [2020-09-04 22:08:21,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 22:08:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 325 transitions. [2020-09-04 22:08:21,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 22:08:21,543 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:21,543 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:21,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 22:08:21,544 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:21,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:21,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1698374602, now seen corresponding path program 1 times [2020-09-04 22:08:21,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:21,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [108546121] [2020-09-04 22:08:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:21,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:21,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [108546121] [2020-09-04 22:08:21,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:21,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:08:21,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710927576] [2020-09-04 22:08:21,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:08:21,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:21,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:08:21,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:08:21,971 INFO L87 Difference]: Start difference. First operand 295 states and 325 transitions. Second operand 17 states. [2020-09-04 22:08:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:23,578 INFO L93 Difference]: Finished difference Result 353 states and 386 transitions. [2020-09-04 22:08:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 22:08:23,578 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-09-04 22:08:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:23,580 INFO L225 Difference]: With dead ends: 353 [2020-09-04 22:08:23,580 INFO L226 Difference]: Without dead ends: 338 [2020-09-04 22:08:23,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 22:08:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-09-04 22:08:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 297. [2020-09-04 22:08:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-09-04 22:08:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 327 transitions. [2020-09-04 22:08:23,617 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 327 transitions. Word has length 79 [2020-09-04 22:08:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:23,617 INFO L479 AbstractCegarLoop]: Abstraction has 297 states and 327 transitions. [2020-09-04 22:08:23,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:08:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 327 transitions. [2020-09-04 22:08:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 22:08:23,619 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:23,619 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:23,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 22:08:23,620 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:23,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1559910918, now seen corresponding path program 2 times [2020-09-04 22:08:23,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:23,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2033043713] [2020-09-04 22:08:23,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:24,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:24,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2033043713] [2020-09-04 22:08:24,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:24,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:08:24,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381614831] [2020-09-04 22:08:24,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:08:24,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:08:24,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:08:24,119 INFO L87 Difference]: Start difference. First operand 297 states and 327 transitions. Second operand 17 states. [2020-09-04 22:08:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:25,721 INFO L93 Difference]: Finished difference Result 335 states and 367 transitions. [2020-09-04 22:08:25,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 22:08:25,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-09-04 22:08:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:25,724 INFO L225 Difference]: With dead ends: 335 [2020-09-04 22:08:25,725 INFO L226 Difference]: Without dead ends: 305 [2020-09-04 22:08:25,726 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 22:08:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-09-04 22:08:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 286. [2020-09-04 22:08:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-09-04 22:08:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2020-09-04 22:08:25,759 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 79 [2020-09-04 22:08:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:25,759 INFO L479 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2020-09-04 22:08:25,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:08:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2020-09-04 22:08:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 22:08:25,760 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:25,761 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:25,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 22:08:25,761 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:25,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:25,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1643861864, now seen corresponding path program 2 times [2020-09-04 22:08:25,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:25,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [49857704] [2020-09-04 22:08:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:26,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:26,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [49857704] [2020-09-04 22:08:26,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:26,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 22:08:26,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042139348] [2020-09-04 22:08:26,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 22:08:26,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 22:08:26,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2020-09-04 22:08:26,259 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand 17 states. [2020-09-04 22:08:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:27,932 INFO L93 Difference]: Finished difference Result 325 states and 355 transitions. [2020-09-04 22:08:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 22:08:27,932 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-09-04 22:08:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:27,934 INFO L225 Difference]: With dead ends: 325 [2020-09-04 22:08:27,934 INFO L226 Difference]: Without dead ends: 299 [2020-09-04 22:08:27,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 22:08:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-09-04 22:08:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 274. [2020-09-04 22:08:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2020-09-04 22:08:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2020-09-04 22:08:27,966 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 79 [2020-09-04 22:08:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:27,966 INFO L479 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2020-09-04 22:08:27,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 22:08:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2020-09-04 22:08:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-09-04 22:08:27,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:27,967 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:27,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 22:08:27,968 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:27,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1435872375, now seen corresponding path program 1 times [2020-09-04 22:08:27,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:27,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [852301063] [2020-09-04 22:08:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:28,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:28,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [852301063] [2020-09-04 22:08:28,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:28,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-09-04 22:08:28,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487307591] [2020-09-04 22:08:28,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 22:08:28,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 22:08:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2020-09-04 22:08:28,690 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand 22 states. [2020-09-04 22:08:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:31,030 INFO L93 Difference]: Finished difference Result 352 states and 384 transitions. [2020-09-04 22:08:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-04 22:08:31,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2020-09-04 22:08:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:31,032 INFO L225 Difference]: With dead ends: 352 [2020-09-04 22:08:31,033 INFO L226 Difference]: Without dead ends: 337 [2020-09-04 22:08:31,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=451, Invalid=2099, Unknown=0, NotChecked=0, Total=2550 [2020-09-04 22:08:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-09-04 22:08:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 290. [2020-09-04 22:08:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-09-04 22:08:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 319 transitions. [2020-09-04 22:08:31,081 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 319 transitions. Word has length 84 [2020-09-04 22:08:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:31,081 INFO L479 AbstractCegarLoop]: Abstraction has 290 states and 319 transitions. [2020-09-04 22:08:31,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 22:08:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 319 transitions. [2020-09-04 22:08:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-09-04 22:08:31,083 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:31,083 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:31,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 22:08:31,083 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1822413145, now seen corresponding path program 3 times [2020-09-04 22:08:31,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:31,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391803337] [2020-09-04 22:08:31,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:32,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:08:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:08:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 22:08:32,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391803337] [2020-09-04 22:08:32,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 22:08:32,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 22:08:32,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319310504] [2020-09-04 22:08:32,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 22:08:32,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:08:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 22:08:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2020-09-04 22:08:32,122 INFO L87 Difference]: Start difference. First operand 290 states and 319 transitions. Second operand 25 states. [2020-09-04 22:08:34,190 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-09-04 22:08:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:08:36,076 INFO L93 Difference]: Finished difference Result 353 states and 385 transitions. [2020-09-04 22:08:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-09-04 22:08:36,076 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2020-09-04 22:08:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:08:36,079 INFO L225 Difference]: With dead ends: 353 [2020-09-04 22:08:36,079 INFO L226 Difference]: Without dead ends: 340 [2020-09-04 22:08:36,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=521, Invalid=2785, Unknown=0, NotChecked=0, Total=3306 [2020-09-04 22:08:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2020-09-04 22:08:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 299. [2020-09-04 22:08:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-09-04 22:08:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 328 transitions. [2020-09-04 22:08:36,113 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 328 transitions. Word has length 84 [2020-09-04 22:08:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:08:36,114 INFO L479 AbstractCegarLoop]: Abstraction has 299 states and 328 transitions. [2020-09-04 22:08:36,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 22:08:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 328 transitions. [2020-09-04 22:08:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-09-04 22:08:36,115 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:08:36,116 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:08:36,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 22:08:36,116 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:08:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:08:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash 752503657, now seen corresponding path program 1 times [2020-09-04 22:08:36,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:08:36,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1294600846] [2020-09-04 22:08:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:08:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 22:08:36,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 22:08:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 22:08:36,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 22:08:36,243 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 22:08:36,244 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 22:08:36,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 22:08:36,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:08:36 BoogieIcfgContainer [2020-09-04 22:08:36,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:08:36,356 INFO L168 Benchmark]: Toolchain (without parser) took 37158.53 ms. Allocated memory was 146.3 MB in the beginning and 491.8 MB in the end (delta: 345.5 MB). Free memory was 102.6 MB in the beginning and 139.0 MB in the end (delta: -36.3 MB). Peak memory consumption was 309.2 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:36,357 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 146.3 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 22:08:36,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 921.25 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 102.4 MB in the beginning and 171.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:36,362 INFO L168 Benchmark]: Boogie Preprocessor took 95.14 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 167.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:36,363 INFO L168 Benchmark]: RCFGBuilder took 1015.55 ms. Allocated memory is still 205.0 MB. Free memory was 167.7 MB in the beginning and 101.0 MB in the end (delta: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:36,364 INFO L168 Benchmark]: TraceAbstraction took 35119.13 ms. Allocated memory was 205.0 MB in the beginning and 491.8 MB in the end (delta: 286.8 MB). Free memory was 100.4 MB in the beginning and 139.0 MB in the end (delta: -38.6 MB). Peak memory consumption was 248.2 MB. Max. memory is 7.1 GB. [2020-09-04 22:08:36,370 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 146.3 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 921.25 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 102.4 MB in the beginning and 171.0 MB in the end (delta: -68.6 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.14 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 167.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1015.55 ms. Allocated memory is still 205.0 MB. Free memory was 167.7 MB in the beginning and 101.0 MB in the end (delta: 66.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35119.13 ms. Allocated memory was 205.0 MB in the beginning and 491.8 MB in the end (delta: 286.8 MB). Free memory was 100.4 MB in the beginning and 139.0 MB in the end (delta: -38.6 MB). Peak memory consumption was 248.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L542] root->left = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L543] root->right = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, malloc(sizeof(*root))={-1:0}, root={-1:0}] [L563] n = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L565] COND TRUE \read(*root) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L566] pred = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, pred={0:0}, root={-1:0}] [L567] n = root VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L568] EXPR n->left VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, pred={0:0}, root={-1:0}] [L568] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, pred={0:0}, root={-1:0}] [L568] EXPR n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L568] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L568] COND FALSE !(n->left || n->right) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L575] COND FALSE !(\read(*pred)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L586] List t; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L587] List p = a; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L589] p->h = 1 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L590] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L591] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L592] p->n = t VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L593] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L593] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L588] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L595] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L596] p->h = 2 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-3:0}] [L597] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L598] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L599] p->n = t VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L600] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->n={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L600] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-4:0}, p->n={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L595] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L602] p->h = 3 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-4:0}, pred={0:0}, root={0:0}, t={-4:0}] [L603] p = a VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-4:0}] [L604] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L604] COND FALSE !(p->h == 2) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L606] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND TRUE p->h == 1 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L607] EXPR p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L607] p = p->n VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->n={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L606] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND FALSE !(p->h == 1) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L608] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L608] COND TRUE p->h != 3 VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L609] __VERIFIER_error() VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 188 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 34.9s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3258 SDtfs, 5761 SDslu, 24558 SDs, 0 SdLazy, 10836 SolverSat, 770 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 779 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 559211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 42/119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...