/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -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-sorted-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:59:24,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:59:24,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:59:24,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:59:24,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:59:24,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:59:24,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:59:24,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:59:24,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:59:24,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:59:24,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:59:24,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:59:24,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:59:24,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:59:24,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:59:24,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:59:24,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:59:24,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:59:24,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:59:24,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:59:24,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:59:24,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:59:24,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:59:24,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:59:24,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:59:24,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:59:24,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:59:24,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:59:24,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:59:24,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:59:24,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:59:24,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:59:24,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:59:24,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:59:24,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:59:24,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:59:24,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:59:24,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:59:24,503 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:59:24,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:59:24,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:59:24,506 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-11-06 22:59:24,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:59:24,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:59:24,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:59:24,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:59:24,531 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:59:24,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:59:24,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:59:24,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:59:24,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:59:24,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:59:24,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:59:24,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:59:24,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:59:24,532 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:59:24,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:59:24,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:59:24,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:59:24,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:59:24,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:59:24,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:59:24,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:59:24,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:59:24,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:59:24,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:59:24,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:59:24,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:59:24,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:59:24,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:59:24,535 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-11-06 22:59:24,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:59:24,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:59:24,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:59:24,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:59:24,828 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:59:24,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-11-06 22:59:24,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3f08fd8/3b6bdabd1fec4b7db771ffd3427ea775/FLAG4f178252e [2019-11-06 22:59:25,452 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:59:25,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2019-11-06 22:59:25,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3f08fd8/3b6bdabd1fec4b7db771ffd3427ea775/FLAG4f178252e [2019-11-06 22:59:25,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3f08fd8/3b6bdabd1fec4b7db771ffd3427ea775 [2019-11-06 22:59:25,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:59:25,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:59:25,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:25,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:59:25,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:59:25,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:25" (1/1) ... [2019-11-06 22:59:25,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b930ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:25, skipping insertion in model container [2019-11-06 22:59:25,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:25" (1/1) ... [2019-11-06 22:59:25,789 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:59:25,839 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:59:26,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:26,300 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:59:26,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:26,423 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:59:26,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26 WrapperNode [2019-11-06 22:59:26,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:26,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:59:26,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:59:26,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:59:26,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (1/1) ... [2019-11-06 22:59:26,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (1/1) ... [2019-11-06 22:59:26,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (1/1) ... [2019-11-06 22:59:26,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (1/1) ... [2019-11-06 22:59:26,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (1/1) ... [2019-11-06 22:59:26,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (1/1) ... [2019-11-06 22:59:26,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (1/1) ... [2019-11-06 22:59:26,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:59:26,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:59:26,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:59:26,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:59:26,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (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-11-06 22:59:26,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:59:26,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:59:26,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:59:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 22:59:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 22:59:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 22:59:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 22:59:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 22:59:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 22:59:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 22:59:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 22:59:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 22:59:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 22:59:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 22:59:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 22:59:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 22:59:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 22:59:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 22:59:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 22:59:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 22:59:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 22:59:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 22:59:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 22:59:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 22:59:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 22:59:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 22:59:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 22:59:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 22:59:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 22:59:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 22:59:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 22:59:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 22:59:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 22:59:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 22:59:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 22:59:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 22:59:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 22:59:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 22:59:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 22:59:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 22:59:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 22:59:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 22:59:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 22:59:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 22:59:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 22:59:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 22:59:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 22:59:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 22:59:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 22:59:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 22:59:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 22:59:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 22:59:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 22:59:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:59:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 22:59:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 22:59:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 22:59:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 22:59:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 22:59:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 22:59:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 22:59:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 22:59:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 22:59:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 22:59:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 22:59:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 22:59:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:59:26,561 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 22:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 22:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 22:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 22:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 22:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 22:59:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 22:59:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 22:59:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 22:59:26,564 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 22:59:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 22:59:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 22:59:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 22:59:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 22:59:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 22:59:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 22:59:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 22:59:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 22:59:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 22:59:26,568 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 22:59:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 22:59:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 22:59:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 22:59:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 22:59:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 22:59:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 22:59:26,569 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 22:59:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 22:59:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 22:59:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 22:59:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 22:59:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 22:59:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 22:59:26,570 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 22:59:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 22:59:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 22:59:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 22:59:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 22:59:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 22:59:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:59:26,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:59:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:59:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:59:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 22:59:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:59:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 22:59:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:59:26,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:59:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:59:26,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:59:27,228 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:59:27,229 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-11-06 22:59:27,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:27 BoogieIcfgContainer [2019-11-06 22:59:27,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:59:27,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:59:27,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:59:27,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:59:27,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:25" (1/3) ... [2019-11-06 22:59:27,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ca8f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:27, skipping insertion in model container [2019-11-06 22:59:27,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:26" (2/3) ... [2019-11-06 22:59:27,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ca8f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:27, skipping insertion in model container [2019-11-06 22:59:27,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:27" (3/3) ... [2019-11-06 22:59:27,241 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2019-11-06 22:59:27,252 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:59:27,262 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-06 22:59:27,275 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-06 22:59:27,301 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:59:27,301 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:59:27,301 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:59:27,301 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:59:27,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:59:27,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:59:27,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:59:27,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:59:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states. [2019-11-06 22:59:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 22:59:27,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:27,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:27,347 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:27,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1007014106, now seen corresponding path program 1 times [2019-11-06 22:59:27,368 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:27,369 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970921566] [2019-11-06 22:59:27,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:27,551 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970921566] [2019-11-06 22:59:27,551 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:27,552 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:59:27,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585399504] [2019-11-06 22:59:27,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:27,561 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:27,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:59:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:59:27,578 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 2 states. [2019-11-06 22:59:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:27,609 INFO L93 Difference]: Finished difference Result 124 states and 196 transitions. [2019-11-06 22:59:27,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:27,611 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-06 22:59:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:27,622 INFO L225 Difference]: With dead ends: 124 [2019-11-06 22:59:27,622 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 22:59:27,626 INFO L630 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-11-06 22:59:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 22:59:27,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-06 22:59:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-06 22:59:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-06 22:59:27,681 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 10 [2019-11-06 22:59:27,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:27,682 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-06 22:59:27,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-06 22:59:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 22:59:27,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:27,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:27,685 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:27,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1170755113, now seen corresponding path program 1 times [2019-11-06 22:59:27,687 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:27,687 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569421846] [2019-11-06 22:59:27,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:27,784 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569421846] [2019-11-06 22:59:27,785 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:27,785 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:59:27,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137935423] [2019-11-06 22:59:27,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:59:27,790 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:27,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:59:27,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:59:27,791 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 3 states. [2019-11-06 22:59:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:27,884 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2019-11-06 22:59:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:27,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-06 22:59:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:27,889 INFO L225 Difference]: With dead ends: 119 [2019-11-06 22:59:27,889 INFO L226 Difference]: Without dead ends: 65 [2019-11-06 22:59:27,892 INFO L630 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-11-06 22:59:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-06 22:59:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-11-06 22:59:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-06 22:59:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-06 22:59:27,908 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 11 [2019-11-06 22:59:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:27,908 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-06 22:59:27,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:59:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-11-06 22:59:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 22:59:27,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:27,911 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:27,912 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1725322068, now seen corresponding path program 1 times [2019-11-06 22:59:27,912 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:27,913 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548002464] [2019-11-06 22:59:27,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 22:59:28,028 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548002464] [2019-11-06 22:59:28,029 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:28,029 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:59:28,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397791039] [2019-11-06 22:59:28,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:59:28,030 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:59:28,030 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 4 states. [2019-11-06 22:59:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:28,159 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2019-11-06 22:59:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:59:28,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-06 22:59:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:28,161 INFO L225 Difference]: With dead ends: 103 [2019-11-06 22:59:28,161 INFO L226 Difference]: Without dead ends: 101 [2019-11-06 22:59:28,162 INFO L630 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-11-06 22:59:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-06 22:59:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2019-11-06 22:59:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-06 22:59:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-11-06 22:59:28,171 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 15 [2019-11-06 22:59:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:28,172 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-11-06 22:59:28,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:59:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2019-11-06 22:59:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:59:28,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:28,173 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:28,173 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:28,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:28,174 INFO L82 PathProgramCache]: Analyzing trace with hash -964262520, now seen corresponding path program 1 times [2019-11-06 22:59:28,174 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:28,174 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836865412] [2019-11-06 22:59:28,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:28,495 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836865412] [2019-11-06 22:59:28,495 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468185514] [2019-11-06 22:59:28,496 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-11-06 22:59:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:28,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 22:59:28,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:59:28,699 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-11-06 22:59:28,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:28,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:28,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:28,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 22:59:28,758 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:28,759 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-11-06 22:59:28,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:28,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:28,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 22:59:28,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:28,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:28,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 22:59:28,806 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:28,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:28,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:28,820 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2019-11-06 22:59:28,864 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 6=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|]} [2019-11-06 22:59:28,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-11-06 22:59:28,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:28,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:28,978 INFO L341 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2019-11-06 22:59:28,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 149 [2019-11-06 22:59:28,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:28,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:28,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:28,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 22:59:29,045 INFO L567 ElimStorePlain]: treesize reduction 222, result has 30.0 percent of original size [2019-11-06 22:59:29,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:29,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 105 [2019-11-06 22:59:29,077 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:29,123 INFO L567 ElimStorePlain]: treesize reduction 58, result has 49.1 percent of original size [2019-11-06 22:59:29,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:29,124 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2019-11-06 22:59:29,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:29,203 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:59:29,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,264 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|]} [2019-11-06 22:59:29,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 24 [2019-11-06 22:59:29,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 22:59:29,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:29,295 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-06 22:59:29,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:29,313 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-06 22:59:29,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:29,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-06 22:59:29,322 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:69, output treesize:39 [2019-11-06 22:59:29,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 346 [2019-11-06 22:59:29,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:29,854 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-11-06 22:59:29,855 INFO L567 ElimStorePlain]: treesize reduction 745, result has 25.0 percent of original size [2019-11-06 22:59:29,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 668 [2019-11-06 22:59:29,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:29,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:29,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:30,618 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 46 [2019-11-06 22:59:30,619 INFO L567 ElimStorePlain]: treesize reduction 4005, result has 5.8 percent of original size [2019-11-06 22:59:30,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:30,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:30,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 30 dim-0 vars, and 9 xjuncts. [2019-11-06 22:59:30,675 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:87, output treesize:516 [2019-11-06 22:59:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:30,911 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [239648384] [2019-11-06 22:59:30,918 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 23 [2019-11-06 22:59:30,978 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:59:30,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:59:31,054 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:59:31,056 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-11-06 22:59:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:31,061 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:59:31,123 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-06 22:59:31,124 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:59:31,125 INFO L553 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-11-06 22:59:31,125 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:59:31,126 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:59:31,126 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8, 7, 7] total 16 [2019-11-06 22:59:31,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663364632] [2019-11-06 22:59:31,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:31,127 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:31,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:59:31,128 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 2 states. [2019-11-06 22:59:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:31,131 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-06 22:59:31,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:31,131 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-11-06 22:59:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:31,131 INFO L225 Difference]: With dead ends: 62 [2019-11-06 22:59:31,131 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:59:31,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:59:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:59:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:59:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:59:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:59:31,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-06 22:59:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:31,133 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:59:31,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:59:31,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:59:31,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:31,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:59:31,388 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:59:31,389 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:59:31,389 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:59:31,389 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:59:31,389 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 22:59:31,389 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:59:31,389 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:59:31,389 INFO L443 ceAbstractionStarter]: For program point L993-1(lines 993 1009) no Hoare annotation was computed. [2019-11-06 22:59:31,390 INFO L443 ceAbstractionStarter]: For program point L993-3(lines 993 1009) no Hoare annotation was computed. [2019-11-06 22:59:31,390 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 982 1065) no Hoare annotation was computed. [2019-11-06 22:59:31,390 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1018) no Hoare annotation was computed. [2019-11-06 22:59:31,390 INFO L443 ceAbstractionStarter]: For program point L1044-1(line 1044) no Hoare annotation was computed. [2019-11-06 22:59:31,390 INFO L443 ceAbstractionStarter]: For program point L1044-2(line 1044) no Hoare annotation was computed. [2019-11-06 22:59:31,390 INFO L443 ceAbstractionStarter]: For program point L1044-4(line 1044) no Hoare annotation was computed. [2019-11-06 22:59:31,390 INFO L439 ceAbstractionStarter]: At program point L1044-5(line 1044) the Hoare annotation is: false [2019-11-06 22:59:31,390 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1052) no Hoare annotation was computed. [2019-11-06 22:59:31,391 INFO L443 ceAbstractionStarter]: For program point L1045(line 1045) no Hoare annotation was computed. [2019-11-06 22:59:31,391 INFO L443 ceAbstractionStarter]: For program point L1045-2(line 1045) no Hoare annotation was computed. [2019-11-06 22:59:31,391 INFO L443 ceAbstractionStarter]: For program point L1045-3(lines 1042 1047) no Hoare annotation was computed. [2019-11-06 22:59:31,391 INFO L443 ceAbstractionStarter]: For program point L1045-4(line 1045) no Hoare annotation was computed. [2019-11-06 22:59:31,391 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 982 1065) no Hoare annotation was computed. [2019-11-06 22:59:31,391 INFO L443 ceAbstractionStarter]: For program point L1013-1(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:31,391 INFO L443 ceAbstractionStarter]: For program point L1013-3(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:31,392 INFO L439 ceAbstractionStarter]: At program point L1013-4(line 1013) the Hoare annotation is: false [2019-11-06 22:59:31,392 INFO L443 ceAbstractionStarter]: For program point L1013-5(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:31,392 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2019-11-06 22:59:31,392 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1037) no Hoare annotation was computed. [2019-11-06 22:59:31,392 INFO L443 ceAbstractionStarter]: For program point L1031-2(lines 1031 1037) no Hoare annotation was computed. [2019-11-06 22:59:31,392 INFO L443 ceAbstractionStarter]: For program point L1048-1(lines 983 1065) no Hoare annotation was computed. [2019-11-06 22:59:31,392 INFO L443 ceAbstractionStarter]: For program point L1048-2(lines 1048 1054) no Hoare annotation was computed. [2019-11-06 22:59:31,392 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1025) no Hoare annotation was computed. [2019-11-06 22:59:31,392 INFO L443 ceAbstractionStarter]: For program point L1016-1(line 1016) no Hoare annotation was computed. [2019-11-06 22:59:31,393 INFO L443 ceAbstractionStarter]: For program point L1016-3(lines 1016 1020) no Hoare annotation was computed. [2019-11-06 22:59:31,393 INFO L439 ceAbstractionStarter]: At program point L1016-5(lines 1016 1020) the Hoare annotation is: false [2019-11-06 22:59:31,393 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1003) no Hoare annotation was computed. [2019-11-06 22:59:31,393 INFO L443 ceAbstractionStarter]: For program point L1000-2(lines 994 1009) no Hoare annotation was computed. [2019-11-06 22:59:31,393 INFO L443 ceAbstractionStarter]: For program point L1051-1(line 1051) no Hoare annotation was computed. [2019-11-06 22:59:31,393 INFO L443 ceAbstractionStarter]: For program point L1018-1(line 1018) no Hoare annotation was computed. [2019-11-06 22:59:31,393 INFO L443 ceAbstractionStarter]: For program point L1051-2(line 1051) no Hoare annotation was computed. [2019-11-06 22:59:31,393 INFO L443 ceAbstractionStarter]: For program point L1018-2(line 1018) no Hoare annotation was computed. [2019-11-06 22:59:31,394 INFO L443 ceAbstractionStarter]: For program point L1051-4(line 1051) no Hoare annotation was computed. [2019-11-06 22:59:31,394 INFO L443 ceAbstractionStarter]: For program point L1018-4(line 1018) no Hoare annotation was computed. [2019-11-06 22:59:31,394 INFO L439 ceAbstractionStarter]: At program point L1051-5(line 1051) the Hoare annotation is: false [2019-11-06 22:59:31,394 INFO L439 ceAbstractionStarter]: At program point L1018-5(line 1018) the Hoare annotation is: false [2019-11-06 22:59:31,394 INFO L443 ceAbstractionStarter]: For program point L1018-6(line 1018) no Hoare annotation was computed. [2019-11-06 22:59:31,394 INFO L443 ceAbstractionStarter]: For program point L1052(line 1052) no Hoare annotation was computed. [2019-11-06 22:59:31,394 INFO L443 ceAbstractionStarter]: For program point L1052-2(line 1052) no Hoare annotation was computed. [2019-11-06 22:59:31,394 INFO L443 ceAbstractionStarter]: For program point L1052-3(lines 1049 1054) no Hoare annotation was computed. [2019-11-06 22:59:31,395 INFO L443 ceAbstractionStarter]: For program point L1052-4(line 1052) no Hoare annotation was computed. [2019-11-06 22:59:31,395 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1044) no Hoare annotation was computed. [2019-11-06 22:59:31,395 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 982 1065) the Hoare annotation is: true [2019-11-06 22:59:31,395 INFO L439 ceAbstractionStarter]: At program point L1005-1(lines 993 1009) the Hoare annotation is: false [2019-11-06 22:59:31,395 INFO L443 ceAbstractionStarter]: For program point L1022(line 1022) no Hoare annotation was computed. [2019-11-06 22:59:31,395 INFO L443 ceAbstractionStarter]: For program point L1022-2(lines 1022 1026) no Hoare annotation was computed. [2019-11-06 22:59:31,395 INFO L443 ceAbstractionStarter]: For program point L1022-4(lines 1022 1026) no Hoare annotation was computed. [2019-11-06 22:59:31,395 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1051) no Hoare annotation was computed. [2019-11-06 22:59:31,396 INFO L446 ceAbstractionStarter]: At program point L1057-2(lines 1057 1062) the Hoare annotation is: true [2019-11-06 22:59:31,396 INFO L443 ceAbstractionStarter]: For program point L1057-3(lines 1057 1062) no Hoare annotation was computed. [2019-11-06 22:59:31,396 INFO L443 ceAbstractionStarter]: For program point L1041-1(line 1041) no Hoare annotation was computed. [2019-11-06 22:59:31,396 INFO L443 ceAbstractionStarter]: For program point L1041-3(lines 1041 1047) no Hoare annotation was computed. [2019-11-06 22:59:31,396 INFO L439 ceAbstractionStarter]: At program point L1041-5(lines 1041 1047) the Hoare annotation is: false [2019-11-06 22:59:31,396 INFO L443 ceAbstractionStarter]: For program point L1025-1(line 1025) no Hoare annotation was computed. [2019-11-06 22:59:31,396 INFO L443 ceAbstractionStarter]: For program point L1025-2(line 1025) no Hoare annotation was computed. [2019-11-06 22:59:31,396 INFO L443 ceAbstractionStarter]: For program point L1025-4(line 1025) no Hoare annotation was computed. [2019-11-06 22:59:31,397 INFO L439 ceAbstractionStarter]: At program point L1025-5(line 1025) the Hoare annotation is: false [2019-11-06 22:59:31,397 INFO L443 ceAbstractionStarter]: For program point L1025-6(lines 983 1065) no Hoare annotation was computed. [2019-11-06 22:59:31,397 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1045) no Hoare annotation was computed. [2019-11-06 22:59:31,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:59:31 BoogieIcfgContainer [2019-11-06 22:59:31,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:59:31,408 INFO L168 Benchmark]: Toolchain (without parser) took 5635.23 ms. Allocated memory was 137.4 MB in the beginning and 251.1 MB in the end (delta: 113.8 MB). Free memory was 98.9 MB in the beginning and 101.9 MB in the end (delta: -2.9 MB). Peak memory consumption was 110.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:31,409 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-06 22:59:31,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.52 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.7 MB in the beginning and 167.6 MB in the end (delta: -68.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:31,410 INFO L168 Benchmark]: Boogie Preprocessor took 70.61 ms. Allocated memory is still 201.3 MB. Free memory was 167.6 MB in the beginning and 164.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:31,411 INFO L168 Benchmark]: RCFGBuilder took 736.40 ms. Allocated memory is still 201.3 MB. Free memory was 164.3 MB in the beginning and 112.8 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:31,412 INFO L168 Benchmark]: TraceAbstraction took 4173.11 ms. Allocated memory was 201.3 MB in the beginning and 251.1 MB in the end (delta: 49.8 MB). Free memory was 112.1 MB in the beginning and 101.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:31,416 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 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 650.52 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.7 MB in the beginning and 167.6 MB in the end (delta: -68.9 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.61 ms. Allocated memory is still 201.3 MB. Free memory was 167.6 MB in the beginning and 164.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 736.40 ms. Allocated memory is still 201.3 MB. Free memory was 164.3 MB in the beginning and 112.8 MB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4173.11 ms. Allocated memory was 201.3 MB in the beginning and 251.1 MB in the end (delta: 49.8 MB). Free memory was 112.1 MB in the beginning and 101.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 60.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1044]: 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: 1025]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1018]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1045]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1051]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1052]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 1018]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1016]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1025]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1013]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1051]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 67 locations, 7 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 196 SDtfs, 180 SDslu, 68 SDs, 0 SdLazy, 52 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=0, 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, 4 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 14 NumberOfFragments, 13 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 96 ConstructedInterpolants, 4 QuantifiedInterpolants, 24315 SizeOfPredicates, 19 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 143, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9166666666666666, AVG_VARS_REMOVED_DURING_WEAKENING: 1.380952380952381, AVG_WEAKENED_CONJUNCTS: 0.2857142857142857, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...