java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/sll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:12:21,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:12:21,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:12:21,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:12:21,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:12:21,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:12:21,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:12:21,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:12:21,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:12:21,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:12:21,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:12:21,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:12:21,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:12:21,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:12:21,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:12:21,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:12:21,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:12:21,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:12:21,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:12:21,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:12:21,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:12:21,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:12:21,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:12:21,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:12:21,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:12:21,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:12:21,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:12:21,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:12:21,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:12:21,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:12:21,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:12:21,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:12:21,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:12:21,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:12:21,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:12:21,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:12:21,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:12:21,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:12:21,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:12:21,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:12:21,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:12:21,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:12:21,312 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:12:21,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:12:21,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:12:21,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:12:21,315 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:12:21,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:12:21,316 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:12:21,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:12:21,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:12:21,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:12:21,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:12:21,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:12:21,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:12:21,319 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:12:21,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:12:21,319 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:12:21,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:12:21,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:12:21,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:12:21,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:12:21,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:12:21,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:21,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:12:21,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:12:21,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:12:21,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:12:21,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:12:21,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:12:21,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:12:21,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:12:21,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:12:21,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:12:21,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:12:21,669 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:12:21,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-10-13 20:12:21,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d314e48cf/e70db42cb2e44572ae95b3905cd32c5f/FLAGa643c4fa0 [2019-10-13 20:12:22,337 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:12:22,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-token-2.i [2019-10-13 20:12:22,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d314e48cf/e70db42cb2e44572ae95b3905cd32c5f/FLAGa643c4fa0 [2019-10-13 20:12:22,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d314e48cf/e70db42cb2e44572ae95b3905cd32c5f [2019-10-13 20:12:22,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:12:22,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:12:22,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:22,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:12:22,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:12:22,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:22" (1/1) ... [2019-10-13 20:12:22,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbeea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:22, skipping insertion in model container [2019-10-13 20:12:22,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:22" (1/1) ... [2019-10-13 20:12:22,658 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:12:22,702 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:12:23,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:23,154 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:12:23,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:23,259 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:12:23,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23 WrapperNode [2019-10-13 20:12:23,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:23,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:12:23,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:12:23,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:12:23,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (1/1) ... [2019-10-13 20:12:23,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (1/1) ... [2019-10-13 20:12:23,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (1/1) ... [2019-10-13 20:12:23,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (1/1) ... [2019-10-13 20:12:23,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (1/1) ... [2019-10-13 20:12:23,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (1/1) ... [2019-10-13 20:12:23,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (1/1) ... [2019-10-13 20:12:23,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:12:23,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:12:23,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:12:23,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:12:23,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:23,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:12:23,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:12:23,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:12:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:12:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:12:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:12:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:12:23,395 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:12:23,396 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:12:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:12:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:12:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:12:23,397 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:12:23,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:12:23,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:12:23,398 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:12:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:12:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:12:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:12:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:12:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:12:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:12:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:12:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:12:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:12:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:12:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:12:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:12:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:12:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:12:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:12:23,403 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:12:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:12:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:12:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:12:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:12:23,404 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:12:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:12:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:12:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:12:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:12:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:12:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:12:23,405 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:12:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:12:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:12:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:12:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:12:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:12:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:12:23,406 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:12:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:12:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:12:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:12:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:12:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:12:23,407 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:12:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:12:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:12:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:12:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:12:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 20:12:23,408 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:12:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:12:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 20:12:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:12:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:12:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 20:12:23,409 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:12:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:12:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:12:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:12:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:12:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:12:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:12:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:12:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:12:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:12:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:12:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:12:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:12:23,411 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:12:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:12:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:12:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:12:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:12:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:12:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:12:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:12:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:12:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:12:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:12:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:12:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:12:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:12:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:12:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:12:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:12:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:12:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:12:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:12:23,414 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:12:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:12:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:12:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:12:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:12:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:12:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:12:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:12:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:12:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:12:23,976 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:12:23,976 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-13 20:12:23,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:23 BoogieIcfgContainer [2019-10-13 20:12:23,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:12:23,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:12:23,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:12:23,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:12:23,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:12:22" (1/3) ... [2019-10-13 20:12:23,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6463d2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:23, skipping insertion in model container [2019-10-13 20:12:23,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:23" (2/3) ... [2019-10-13 20:12:23,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6463d2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:23, skipping insertion in model container [2019-10-13 20:12:23,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:23" (3/3) ... [2019-10-13 20:12:23,986 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-token-2.i [2019-10-13 20:12:23,996 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:12:24,005 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 20:12:24,016 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 20:12:24,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:12:24,046 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:12:24,046 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:12:24,046 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:12:24,055 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:12:24,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:12:24,055 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:12:24,055 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:12:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-10-13 20:12:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 20:12:24,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:24,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:24,080 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 68430596, now seen corresponding path program 1 times [2019-10-13 20:12:24,095 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:24,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63381872] [2019-10-13 20:12:24,095 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:24,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:24,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:24,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63381872] [2019-10-13 20:12:24,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:24,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:12:24,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541621552] [2019-10-13 20:12:24,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:24,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:24,280 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2019-10-13 20:12:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:24,323 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2019-10-13 20:12:24,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:24,326 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-13 20:12:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:24,343 INFO L225 Difference]: With dead ends: 92 [2019-10-13 20:12:24,343 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 20:12:24,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 20:12:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-13 20:12:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 20:12:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-10-13 20:12:24,407 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2019-10-13 20:12:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:24,408 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-10-13 20:12:24,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-10-13 20:12:24,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 20:12:24,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:24,410 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:24,411 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:24,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:24,412 INFO L82 PathProgramCache]: Analyzing trace with hash 67663975, now seen corresponding path program 1 times [2019-10-13 20:12:24,412 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:24,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262467030] [2019-10-13 20:12:24,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:24,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:24,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:24,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:24,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262467030] [2019-10-13 20:12:24,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:24,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:24,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022340850] [2019-10-13 20:12:24,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:24,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:24,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:24,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:24,519 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 3 states. [2019-10-13 20:12:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:24,592 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-13 20:12:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:24,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 20:12:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:24,594 INFO L225 Difference]: With dead ends: 43 [2019-10-13 20:12:24,595 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 20:12:24,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 20:12:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-13 20:12:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 20:12:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-10-13 20:12:24,604 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2019-10-13 20:12:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:24,605 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-10-13 20:12:24,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-10-13 20:12:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 20:12:24,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:24,606 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:24,607 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2097539711, now seen corresponding path program 1 times [2019-10-13 20:12:24,608 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:24,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299727775] [2019-10-13 20:12:24,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:24,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:24,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:24,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:24,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299727775] [2019-10-13 20:12:24,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:24,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:12:24,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291900533] [2019-10-13 20:12:24,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:12:24,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:24,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:12:24,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:12:24,719 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 4 states. [2019-10-13 20:12:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:24,810 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-10-13 20:12:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:12:24,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 20:12:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:24,814 INFO L225 Difference]: With dead ends: 67 [2019-10-13 20:12:24,814 INFO L226 Difference]: Without dead ends: 65 [2019-10-13 20:12:24,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-13 20:12:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-10-13 20:12:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 20:12:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-13 20:12:24,827 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2019-10-13 20:12:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:24,827 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-13 20:12:24,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:12:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-13 20:12:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 20:12:24,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:24,829 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:24,831 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:24,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:24,832 INFO L82 PathProgramCache]: Analyzing trace with hash -409997773, now seen corresponding path program 1 times [2019-10-13 20:12:24,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:24,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010114828] [2019-10-13 20:12:24,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:24,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:24,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:24,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010114828] [2019-10-13 20:12:24,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:24,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:24,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397493997] [2019-10-13 20:12:24,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:24,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:24,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:24,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:24,911 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 5 states. [2019-10-13 20:12:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:25,012 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-13 20:12:25,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:25,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 20:12:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:25,015 INFO L225 Difference]: With dead ends: 39 [2019-10-13 20:12:25,015 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 20:12:25,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 20:12:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-13 20:12:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 20:12:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-13 20:12:25,021 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2019-10-13 20:12:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:25,022 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-13 20:12:25,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-13 20:12:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 20:12:25,022 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:25,023 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:25,023 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:25,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:25,023 INFO L82 PathProgramCache]: Analyzing trace with hash -409960037, now seen corresponding path program 1 times [2019-10-13 20:12:25,024 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:25,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261154908] [2019-10-13 20:12:25,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:25,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:25,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:25,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261154908] [2019-10-13 20:12:25,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:25,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:12:25,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717645763] [2019-10-13 20:12:25,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:12:25,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:25,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:12:25,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:12:25,287 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2019-10-13 20:12:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:25,469 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-10-13 20:12:25,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:25,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 20:12:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:25,470 INFO L225 Difference]: With dead ends: 72 [2019-10-13 20:12:25,471 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 20:12:25,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 20:12:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-10-13 20:12:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 20:12:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-13 20:12:25,479 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2019-10-13 20:12:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:25,479 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-13 20:12:25,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:12:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-13 20:12:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:25,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:25,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:25,481 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:25,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:25,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1407314597, now seen corresponding path program 1 times [2019-10-13 20:12:25,481 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:25,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087635606] [2019-10-13 20:12:25,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:25,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:25,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:25,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087635606] [2019-10-13 20:12:25,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:25,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:12:25,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379403568] [2019-10-13 20:12:25,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:12:25,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:12:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:25,602 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 6 states. [2019-10-13 20:12:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:25,760 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-10-13 20:12:25,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:12:25,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 20:12:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:25,763 INFO L225 Difference]: With dead ends: 54 [2019-10-13 20:12:25,763 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 20:12:25,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:12:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 20:12:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-10-13 20:12:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 20:12:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-10-13 20:12:25,776 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 20 [2019-10-13 20:12:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:25,777 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-10-13 20:12:25,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:12:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-10-13 20:12:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 20:12:25,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:25,779 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:25,780 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1742673852, now seen corresponding path program 1 times [2019-10-13 20:12:25,781 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:25,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388477599] [2019-10-13 20:12:25,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:25,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:25,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:26,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388477599] [2019-10-13 20:12:26,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060030987] [2019-10-13 20:12:26,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:26,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-13 20:12:26,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:26,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 20:12:26,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 20:12:26,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,306 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-13 20:12:26,373 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 20:12:26,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,420 INFO L567 ElimStorePlain]: treesize reduction 14, result has 79.7 percent of original size [2019-10-13 20:12:26,428 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:26,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:26,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-10-13 20:12:26,456 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,474 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:36 [2019-10-13 20:12:26,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 20:12:26,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,553 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|], 10=[|v_#memory_int_26|]} [2019-10-13 20:12:26,560 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:26,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,616 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-13 20:12:26,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 39 [2019-10-13 20:12:26,618 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:26,636 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:72, output treesize:41 [2019-10-13 20:12:26,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-10-13 20:12:26,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:26,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-13 20:12:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:26,702 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:26,717 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:26,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:26,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:52 [2019-10-13 20:12:26,768 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:26,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:26,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:26,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:93 [2019-10-13 20:12:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:26,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:12:26,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2019-10-13 20:12:26,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683912071] [2019-10-13 20:12:26,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:12:26,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:12:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-13 20:12:26,849 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2019-10-13 20:12:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:27,428 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-10-13 20:12:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 20:12:27,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 20:12:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:27,429 INFO L225 Difference]: With dead ends: 62 [2019-10-13 20:12:27,429 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 20:12:27,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:12:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 20:12:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2019-10-13 20:12:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 20:12:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-13 20:12:27,439 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 20 [2019-10-13 20:12:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:27,439 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-13 20:12:27,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:12:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-13 20:12:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 20:12:27,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:27,441 INFO L380 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] [2019-10-13 20:12:27,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:27,650 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:27,651 INFO L82 PathProgramCache]: Analyzing trace with hash 995688324, now seen corresponding path program 1 times [2019-10-13 20:12:27,651 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:27,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516975709] [2019-10-13 20:12:27,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:27,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:27,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:27,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516975709] [2019-10-13 20:12:27,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380021429] [2019-10-13 20:12:27,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:27,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 20:12:27,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:27,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 20:12:27,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:27,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:27,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 20:12:27,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:27,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:27,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:27,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-13 20:12:28,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 20:12:28,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:28,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-13 20:12:28,049 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-10-13 20:12:28,065 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,080 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:26 [2019-10-13 20:12:28,106 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_32|], 10=[|v_#memory_int_34|]} [2019-10-13 20:12:28,109 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:28,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,234 INFO L341 Elim1Store]: treesize reduction 30, result has 75.8 percent of original size [2019-10-13 20:12:28,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 107 [2019-10-13 20:12:28,236 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,292 INFO L567 ElimStorePlain]: treesize reduction 48, result has 55.6 percent of original size [2019-10-13 20:12:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:28,305 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:55, output treesize:90 [2019-10-13 20:12:28,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:28,459 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 39 [2019-10-13 20:12:28,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2019-10-13 20:12:28,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-10-13 20:12:28,474 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,524 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.7 percent of original size [2019-10-13 20:12:28,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 20:12:28,527 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:90, output treesize:7 [2019-10-13 20:12:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:28,544 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:28,577 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:28,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:28,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:44 [2019-10-13 20:12:28,613 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:28,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:28,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:83 [2019-10-13 20:12:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:28,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1963098277] [2019-10-13 20:12:28,698 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 25 [2019-10-13 20:12:28,739 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:12:28,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 20:12:28,807 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 20:12:28,808 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 36 variables. [2019-10-13 20:12:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:28,813 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 20:12:28,846 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-13 20:12:28,846 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 20:12:28,847 INFO L553 sIntCurrentIteration]: We unified 23 AI predicates to 23 [2019-10-13 20:12:28,848 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 20:12:28,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:12:28,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 6] total 14 [2019-10-13 20:12:28,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842672283] [2019-10-13 20:12:28,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:28,850 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:28,850 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 20:12:28,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:28,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:28,851 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 2 states. [2019-10-13 20:12:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:28,852 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-10-13 20:12:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:28,852 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2019-10-13 20:12:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:28,853 INFO L225 Difference]: With dead ends: 54 [2019-10-13 20:12:28,853 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 20:12:28,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 20:12:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 20:12:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 20:12:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 20:12:28,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-10-13 20:12:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:28,855 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 20:12:28,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 20:12:28,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 20:12:29,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:29,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 20:12:29,083 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:29,083 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:29,083 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:29,083 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:29,083 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 20:12:29,084 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:29,084 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:29,084 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:29,084 INFO L443 ceAbstractionStarter]: For program point L1026-1(lines 1026 1031) no Hoare annotation was computed. [2019-10-13 20:12:29,084 INFO L439 ceAbstractionStarter]: At program point L1026-3(lines 1026 1031) the Hoare annotation is: false [2019-10-13 20:12:29,084 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 989 1037) no Hoare annotation was computed. [2019-10-13 20:12:29,084 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:29,084 INFO L443 ceAbstractionStarter]: For program point L1020(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:29,084 INFO L443 ceAbstractionStarter]: For program point L1020-1(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:29,084 INFO L443 ceAbstractionStarter]: For program point L1020-3(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L443 ceAbstractionStarter]: For program point L1020-4(lines 990 1037) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L443 ceAbstractionStarter]: For program point L1020-5(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 989 1037) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 989 1037) the Hoare annotation is: true [2019-10-13 20:12:29,085 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1005) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L443 ceAbstractionStarter]: For program point L1013-1(line 1013) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L443 ceAbstractionStarter]: For program point L1013-3(line 1013) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L439 ceAbstractionStarter]: At program point L1013-4(line 1013) the Hoare annotation is: false [2019-10-13 20:12:29,085 INFO L443 ceAbstractionStarter]: For program point L1005-1(line 1005) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L443 ceAbstractionStarter]: For program point L1005-3(line 1005) no Hoare annotation was computed. [2019-10-13 20:12:29,085 INFO L439 ceAbstractionStarter]: At program point L1005-4(line 1005) the Hoare annotation is: false [2019-10-13 20:12:29,086 INFO L439 ceAbstractionStarter]: At program point L1005-5(lines 999 1006) the Hoare annotation is: false [2019-10-13 20:12:29,086 INFO L443 ceAbstractionStarter]: For program point L1022-1(line 1022) no Hoare annotation was computed. [2019-10-13 20:12:29,086 INFO L443 ceAbstractionStarter]: For program point L1022-2(line 1022) no Hoare annotation was computed. [2019-10-13 20:12:29,086 INFO L443 ceAbstractionStarter]: For program point L1022-4(line 1022) no Hoare annotation was computed. [2019-10-13 20:12:29,086 INFO L439 ceAbstractionStarter]: At program point L1022-5(line 1022) the Hoare annotation is: false [2019-10-13 20:12:29,086 INFO L443 ceAbstractionStarter]: For program point L1022-6(line 1022) no Hoare annotation was computed. [2019-10-13 20:12:29,086 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:29,086 INFO L443 ceAbstractionStarter]: For program point L1015(lines 1015 1019) no Hoare annotation was computed. [2019-10-13 20:12:29,086 INFO L443 ceAbstractionStarter]: For program point L1015-2(lines 990 1037) no Hoare annotation was computed. [2019-10-13 20:12:29,086 INFO L443 ceAbstractionStarter]: For program point L1032(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:29,087 INFO L443 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:29,087 INFO L443 ceAbstractionStarter]: For program point L999-1(lines 999 1006) no Hoare annotation was computed. [2019-10-13 20:12:29,087 INFO L443 ceAbstractionStarter]: For program point L1032-3(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:29,087 INFO L443 ceAbstractionStarter]: For program point L999-3(lines 999 1006) no Hoare annotation was computed. [2019-10-13 20:12:29,087 INFO L443 ceAbstractionStarter]: For program point L1032-4(lines 990 1037) no Hoare annotation was computed. [2019-10-13 20:12:29,087 INFO L443 ceAbstractionStarter]: For program point L1032-5(line 1032) no Hoare annotation was computed. [2019-10-13 20:12:29,087 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2019-10-13 20:12:29,087 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1022) no Hoare annotation was computed. [2019-10-13 20:12:29,088 INFO L443 ceAbstractionStarter]: For program point L1017-1(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:29,088 INFO L443 ceAbstractionStarter]: For program point L1017-2(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:29,088 INFO L443 ceAbstractionStarter]: For program point L1017-4(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:29,088 INFO L439 ceAbstractionStarter]: At program point L1017-5(line 1017) the Hoare annotation is: false [2019-10-13 20:12:29,088 INFO L443 ceAbstractionStarter]: For program point L1017-6(line 1017) no Hoare annotation was computed. [2019-10-13 20:12:29,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:12:29 BoogieIcfgContainer [2019-10-13 20:12:29,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 20:12:29,098 INFO L168 Benchmark]: Toolchain (without parser) took 6456.57 ms. Allocated memory was 145.2 MB in the beginning and 287.8 MB in the end (delta: 142.6 MB). Free memory was 101.5 MB in the beginning and 236.9 MB in the end (delta: -135.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:29,099 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 20:12:29,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.10 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 168.9 MB in the end (delta: -67.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:29,100 INFO L168 Benchmark]: Boogie Preprocessor took 69.33 ms. Allocated memory is still 202.4 MB. Free memory was 168.9 MB in the beginning and 166.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:29,101 INFO L168 Benchmark]: RCFGBuilder took 647.74 ms. Allocated memory is still 202.4 MB. Free memory was 166.2 MB in the beginning and 121.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:29,102 INFO L168 Benchmark]: TraceAbstraction took 5118.01 ms. Allocated memory was 202.4 MB in the beginning and 287.8 MB in the end (delta: 85.5 MB). Free memory was 121.1 MB in the beginning and 236.9 MB in the end (delta: -115.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 20:12:29,104 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 617.10 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 168.9 MB in the end (delta: -67.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.33 ms. Allocated memory is still 202.4 MB. Free memory was 168.9 MB in the beginning and 166.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 647.74 ms. Allocated memory is still 202.4 MB. Free memory was 166.2 MB in the beginning and 121.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5118.01 ms. Allocated memory was 202.4 MB in the beginning and 287.8 MB in the end (delta: 85.5 MB). Free memory was 121.1 MB in the beginning and 236.9 MB in the end (delta: -115.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1032]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1020]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1022]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1013]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1005]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 1026]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1005]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1022]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 999]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1013]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 6 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 120 SDslu, 386 SDs, 0 SdLazy, 257 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 10 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 203 ConstructedInterpolants, 22 QuantifiedInterpolants, 52611 SizeOfPredicates, 22 NumberOfNonLiveVariables, 216 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 2/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 115, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9347826086956522, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9130434782608695, AVG_WEAKENED_CONJUNCTS: 0.2608695652173913, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...