./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 751def0588f132c393a8666a5acb62e8205c40a1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:41:29,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:41:29,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:41:29,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:41:29,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:41:29,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:41:29,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:41:29,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:41:29,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:41:29,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:41:29,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:41:29,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:41:29,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:41:29,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:41:29,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:41:29,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:41:29,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:41:29,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:41:29,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:41:29,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:41:29,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:41:29,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:41:29,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:41:29,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:41:29,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:41:29,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:41:29,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:41:29,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:41:29,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:41:29,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:41:29,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:41:29,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:41:29,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:41:29,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:41:29,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:41:29,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:41:29,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:41:29,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:41:29,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:41:29,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:41:29,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:41:29,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:41:29,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:41:29,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:41:29,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:41:29,465 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:41:29,465 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:41:29,466 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:41:29,466 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:41:29,466 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:41:29,466 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:41:29,466 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:41:29,467 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:41:29,468 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:41:29,468 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:41:29,468 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:41:29,468 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:41:29,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:41:29,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:41:29,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:41:29,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:41:29,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:41:29,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:41:29,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:41:29,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:41:29,470 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:41:29,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:41:29,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:41:29,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:41:29,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:41:29,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:41:29,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:41:29,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:41:29,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:41:29,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:41:29,473 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:41:29,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:41:29,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:41:29,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:41:29,474 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 751def0588f132c393a8666a5acb62e8205c40a1 [2019-11-26 02:41:29,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:41:29,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:41:29,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:41:29,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:41:29,680 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:41:29,681 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2019-11-26 02:41:29,737 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/data/99a3cc783/70509fdbda394e4da2748ac5f2b9c3a3/FLAG6fcb83e19 [2019-11-26 02:41:30,100 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:41:30,100 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2019-11-26 02:41:30,106 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/data/99a3cc783/70509fdbda394e4da2748ac5f2b9c3a3/FLAG6fcb83e19 [2019-11-26 02:41:30,511 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/data/99a3cc783/70509fdbda394e4da2748ac5f2b9c3a3 [2019-11-26 02:41:30,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:41:30,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:41:30,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:41:30,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:41:30,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:41:30,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6837a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30, skipping insertion in model container [2019-11-26 02:41:30,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:41:30,543 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:41:30,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:41:30,677 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:41:30,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:41:30,772 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:41:30,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30 WrapperNode [2019-11-26 02:41:30,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:41:30,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:41:30,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:41:30,774 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:41:30,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:41:30,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:41:30,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:41:30,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:41:30,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... [2019-11-26 02:41:30,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:41:30,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:41:30,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:41:30,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:41:30,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/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-26 02:41:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:41:30,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:41:31,320 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:41:31,321 INFO L284 CfgBuilder]: Removed 38 assume(true) statements. [2019-11-26 02:41:31,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:41:31 BoogieIcfgContainer [2019-11-26 02:41:31,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:41:31,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:41:31,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:41:31,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:41:31,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:41:30" (1/3) ... [2019-11-26 02:41:31,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425126de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:41:31, skipping insertion in model container [2019-11-26 02:41:31,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:30" (2/3) ... [2019-11-26 02:41:31,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425126de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:41:31, skipping insertion in model container [2019-11-26 02:41:31,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:41:31" (3/3) ... [2019-11-26 02:41:31,329 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-11-26 02:41:31,338 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:41:31,344 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-26 02:41:31,355 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-26 02:41:31,378 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:41:31,378 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:41:31,378 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:41:31,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:41:31,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:41:31,379 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:41:31,379 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:41:31,379 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:41:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-11-26 02:41:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:41:31,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:31,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:31,401 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1479268755, now seen corresponding path program 1 times [2019-11-26 02:41:31,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:31,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820377227] [2019-11-26 02:41:31,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:31,568 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-26 02:41:31,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820377227] [2019-11-26 02:41:31,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:31,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:41:31,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861306613] [2019-11-26 02:41:31,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:41:31,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:41:31,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:41:31,593 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2019-11-26 02:41:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:31,723 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2019-11-26 02:41:31,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:41:31,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-26 02:41:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:31,733 INFO L225 Difference]: With dead ends: 148 [2019-11-26 02:41:31,733 INFO L226 Difference]: Without dead ends: 73 [2019-11-26 02:41:31,736 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-26 02:41:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-26 02:41:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-11-26 02:41:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-26 02:41:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-26 02:41:31,773 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 7 [2019-11-26 02:41:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:31,774 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-26 02:41:31,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:41:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-26 02:41:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:41:31,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:31,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:31,775 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1391586898, now seen corresponding path program 1 times [2019-11-26 02:41:31,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:31,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757200082] [2019-11-26 02:41:31,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:31,826 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-26 02:41:31,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757200082] [2019-11-26 02:41:31,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:31,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:41:31,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331570035] [2019-11-26 02:41:31,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:41:31,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:41:31,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:31,829 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 4 states. [2019-11-26 02:41:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:31,972 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-11-26 02:41:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:41:31,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-26 02:41:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:31,974 INFO L225 Difference]: With dead ends: 76 [2019-11-26 02:41:31,974 INFO L226 Difference]: Without dead ends: 72 [2019-11-26 02:41:31,975 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-26 02:41:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-26 02:41:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2019-11-26 02:41:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-26 02:41:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-11-26 02:41:31,986 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 8 [2019-11-26 02:41:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:31,986 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-11-26 02:41:31,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:41:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-11-26 02:41:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:41:31,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:31,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:31,988 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:31,988 INFO L82 PathProgramCache]: Analyzing trace with hash 57057392, now seen corresponding path program 1 times [2019-11-26 02:41:31,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:31,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430705794] [2019-11-26 02:41:31,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:32,023 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-26 02:41:32,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430705794] [2019-11-26 02:41:32,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:32,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:41:32,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987622989] [2019-11-26 02:41:32,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:41:32,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:32,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:41:32,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:32,024 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2019-11-26 02:41:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:32,159 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-11-26 02:41:32,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:41:32,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-26 02:41:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:32,160 INFO L225 Difference]: With dead ends: 69 [2019-11-26 02:41:32,160 INFO L226 Difference]: Without dead ends: 61 [2019-11-26 02:41:32,161 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-26 02:41:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-26 02:41:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-11-26 02:41:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-26 02:41:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-11-26 02:41:32,169 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 9 [2019-11-26 02:41:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:32,169 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-11-26 02:41:32,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:41:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-11-26 02:41:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:41:32,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:32,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:32,171 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1711132744, now seen corresponding path program 1 times [2019-11-26 02:41:32,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:32,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005177098] [2019-11-26 02:41:32,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:32,234 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-26 02:41:32,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005177098] [2019-11-26 02:41:32,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:32,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:41:32,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179456852] [2019-11-26 02:41:32,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:41:32,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:32,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:41:32,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:41:32,236 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2019-11-26 02:41:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:32,384 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-11-26 02:41:32,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:41:32,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-26 02:41:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:32,386 INFO L225 Difference]: With dead ends: 61 [2019-11-26 02:41:32,386 INFO L226 Difference]: Without dead ends: 57 [2019-11-26 02:41:32,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:41:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-26 02:41:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-26 02:41:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-26 02:41:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-26 02:41:32,399 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2019-11-26 02:41:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:32,399 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-26 02:41:32,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:41:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-26 02:41:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:41:32,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:32,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:32,403 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:32,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:32,403 INFO L82 PathProgramCache]: Analyzing trace with hash 574068571, now seen corresponding path program 1 times [2019-11-26 02:41:32,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:32,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885994048] [2019-11-26 02:41:32,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:32,453 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-26 02:41:32,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885994048] [2019-11-26 02:41:32,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:32,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:41:32,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109923235] [2019-11-26 02:41:32,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:41:32,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:32,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:41:32,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:32,455 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2019-11-26 02:41:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:32,554 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-26 02:41:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:41:32,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-26 02:41:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:32,556 INFO L225 Difference]: With dead ends: 58 [2019-11-26 02:41:32,556 INFO L226 Difference]: Without dead ends: 50 [2019-11-26 02:41:32,556 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-26 02:41:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-26 02:41:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-26 02:41:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-26 02:41:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-26 02:41:32,570 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2019-11-26 02:41:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:32,570 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-26 02:41:32,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:41:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-26 02:41:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:41:32,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:32,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:32,573 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:32,577 INFO L82 PathProgramCache]: Analyzing trace with hash -470786895, now seen corresponding path program 1 times [2019-11-26 02:41:32,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:32,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648096322] [2019-11-26 02:41:32,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:32,650 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-26 02:41:32,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648096322] [2019-11-26 02:41:32,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:32,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:41:32,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183657657] [2019-11-26 02:41:32,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:41:32,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:41:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:32,652 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-11-26 02:41:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:32,761 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-26 02:41:32,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:41:32,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-26 02:41:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:32,764 INFO L225 Difference]: With dead ends: 58 [2019-11-26 02:41:32,764 INFO L226 Difference]: Without dead ends: 56 [2019-11-26 02:41:32,764 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-26 02:41:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-26 02:41:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-11-26 02:41:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 02:41:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-26 02:41:32,776 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2019-11-26 02:41:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:32,782 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-26 02:41:32,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:41:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-26 02:41:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:41:32,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:32,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:32,784 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:41:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1892453097, now seen corresponding path program 1 times [2019-11-26 02:41:32,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:41:32,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536756943] [2019-11-26 02:41:32,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:41:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:32,878 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-26 02:41:32,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536756943] [2019-11-26 02:41:32,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:32,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:41:32,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012137523] [2019-11-26 02:41:32,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:41:32,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:41:32,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:41:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:41:32,880 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2019-11-26 02:41:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:33,046 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-11-26 02:41:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:41:33,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-26 02:41:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:33,049 INFO L225 Difference]: With dead ends: 49 [2019-11-26 02:41:33,049 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:41:33,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:41:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:41:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:41:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:41:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:41:33,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-26 02:41:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:33,051 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:41:33,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:41:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:41:33,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:41:33,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:41:33,547 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,547 INFO L447 ceAbstractionStarter]: At program point L52(lines 10 53) the Hoare annotation is: true [2019-11-26 02:41:33,547 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,547 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:41:33,547 INFO L440 ceAbstractionStarter]: At program point L20-2(lines 20 51) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-26 02:41:33,547 INFO L444 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,548 INFO L440 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,548 INFO L444 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,548 INFO L440 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,548 INFO L444 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,548 INFO L440 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,548 INFO L444 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,549 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,549 INFO L440 ceAbstractionStarter]: At program point L4-11(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,549 INFO L444 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,549 INFO L440 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,549 INFO L444 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,550 INFO L440 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~len~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,550 INFO L440 ceAbstractionStarter]: At program point L21-2(lines 21 50) the Hoare annotation is: (and (or (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0)) (<= 0 ULTIMATE.start_main_~j~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-26 02:41:33,550 INFO L444 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,550 INFO L440 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,550 INFO L444 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,550 INFO L440 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,550 INFO L444 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,551 INFO L440 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,551 INFO L444 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,551 INFO L440 ceAbstractionStarter]: At program point L4-29(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,551 INFO L444 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,551 INFO L444 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,551 INFO L444 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,552 INFO L440 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,552 INFO L444 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,552 INFO L444 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,552 INFO L444 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,552 INFO L444 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,552 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,552 INFO L440 ceAbstractionStarter]: At program point L4-35(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~i~0)) [2019-11-26 02:41:33,552 INFO L444 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,553 INFO L444 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,553 INFO L444 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,553 INFO L444 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,553 INFO L440 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-26 02:41:33,553 INFO L444 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,553 INFO L444 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,553 INFO L444 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,553 INFO L444 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,554 INFO L440 ceAbstractionStarter]: At program point L4-41(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-26 02:41:33,554 INFO L444 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,554 INFO L444 ceAbstractionStarter]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,554 INFO L444 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,554 INFO L444 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,554 INFO L440 ceAbstractionStarter]: At program point L4-44(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-26 02:41:33,554 INFO L444 ceAbstractionStarter]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,555 INFO L444 ceAbstractionStarter]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:41:33,555 INFO L444 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-11-26 02:41:33,555 INFO L444 ceAbstractionStarter]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,555 INFO L440 ceAbstractionStarter]: At program point L4-47(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-26 02:41:33,555 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,555 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:41:33,555 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,556 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-26 02:41:33,556 INFO L440 ceAbstractionStarter]: At program point L42(lines 22 49) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 5) ULTIMATE.start_main_~bufsize~0) (<= 0 ULTIMATE.start_main_~j~0) (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~len~0) (<= 0 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~limit~0 4) ULTIMATE.start_main_~bufsize~0)) [2019-11-26 02:41:33,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,557 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,557 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,557 INFO L444 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-26 02:41:33,557 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:41:33,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:41:33 BoogieIcfgContainer [2019-11-26 02:41:33,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:41:33,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:41:33,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:41:33,580 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:41:33,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:41:31" (3/4) ... [2019-11-26 02:41:33,583 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:41:33,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-11-26 02:41:33,594 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-26 02:41:33,664 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a5de365f-f7b3-409d-856a-ba5493d36b6e/bin/utaipan/witness.graphml [2019-11-26 02:41:33,665 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:41:33,667 INFO L168 Benchmark]: Toolchain (without parser) took 3151.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.7 MB in the beginning and 847.8 MB in the end (delta: 97.0 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:33,668 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:41:33,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:33,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:41:33,669 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:41:33,669 INFO L168 Benchmark]: RCFGBuilder took 482.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:33,670 INFO L168 Benchmark]: TraceAbstraction took 2256.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 854.7 MB in the end (delta: 223.6 MB). Peak memory consumption was 223.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:33,670 INFO L168 Benchmark]: Witness Printer took 85.78 ms. Allocated memory is still 1.1 GB. Free memory was 854.7 MB in the beginning and 847.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:33,672 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 482.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2256.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 854.7 MB in the end (delta: 223.6 MB). Peak memory consumption was 223.6 MB. Max. memory is 11.5 GB. * Witness Printer took 85.78 ms. Allocated memory is still 1.1 GB. Free memory was 854.7 MB in the beginning and 847.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((!(0 == cond) || i + 1 <= len) && 0 <= j) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 4 <= bufsize && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && !(0 == cond)) && 0 <= j) && i + 1 <= len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((j + 5 <= bufsize && i + 2 <= len) && !(0 == cond)) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && 0 <= j) && limit + 4 <= bufsize) && 0 <= i - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 16 error locations. Result: SAFE, OverallTime: 2.1s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 341 SDtfs, 308 SDslu, 147 SDs, 0 SdLazy, 338 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 7 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 46 NumberOfFragments, 430 HoareAnnotationTreeSize, 20 FomulaSimplifications, 4064 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 98 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 5168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...