./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/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-cad4683 [2019-10-22 11:27:00,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:27:00,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:27:00,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:27:00,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:27:00,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:27:00,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:27:00,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:27:00,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:27:00,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:27:00,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:27:00,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:27:00,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:27:00,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:27:00,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:27:00,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:27:00,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:27:00,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:27:00,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:27:00,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:27:00,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:27:00,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:27:00,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:27:00,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:27:00,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:27:00,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:27:00,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:27:00,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:27:00,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:27:00,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:27:00,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:27:00,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:27:00,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:27:00,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:27:00,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:27:00,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:27:00,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:27:00,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:27:00,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:27:00,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:27:00,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:27:00,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:27:00,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:27:00,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:27:00,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:27:00,745 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:27:00,745 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:27:00,745 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:27:00,746 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:27:00,746 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:27:00,746 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:27:00,746 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:27:00,747 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:27:00,747 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:27:00,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:27:00,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:27:00,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:27:00,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:27:00,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:27:00,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:27:00,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:27:00,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:27:00,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:27:00,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:27:00,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:27:00,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:27:00,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:27:00,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:27:00,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:27:00,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:27:00,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:27:00,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:27:00,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:27:00,751 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:27:00,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:27:00,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:27:00,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:27:00,751 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/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/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-10-22 11:27:00,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:27:00,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:27:00,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:27:00,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:27:00,797 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:27:00,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2019-10-22 11:27:00,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/data/dcf9c6a51/cb2fe6e00baf4620a362b05365a4a3de/FLAG103176439 [2019-10-22 11:27:01,214 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:27:01,214 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2019-10-22 11:27:01,221 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/data/dcf9c6a51/cb2fe6e00baf4620a362b05365a4a3de/FLAG103176439 [2019-10-22 11:27:01,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/data/dcf9c6a51/cb2fe6e00baf4620a362b05365a4a3de [2019-10-22 11:27:01,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:27:01,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:27:01,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:01,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:27:01,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:27:01,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db8532c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01, skipping insertion in model container [2019-10-22 11:27:01,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,256 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:27:01,272 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:27:01,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:01,437 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:27:01,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:27:01,525 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:27:01,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01 WrapperNode [2019-10-22 11:27:01,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:27:01,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:01,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:27:01,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:27:01,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:27:01,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:27:01,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:27:01,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:27:01,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... [2019-10-22 11:27:01,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:27:01,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:27:01,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:27:01,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:27:01,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/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-10-22 11:27:01,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:27:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:27:01,881 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:27:01,882 INFO L284 CfgBuilder]: Removed 38 assume(true) statements. [2019-10-22 11:27:01,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:01 BoogieIcfgContainer [2019-10-22 11:27:01,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:27:01,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:27:01,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:27:01,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:27:01,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:27:01" (1/3) ... [2019-10-22 11:27:01,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d57cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:01, skipping insertion in model container [2019-10-22 11:27:01,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:27:01" (2/3) ... [2019-10-22 11:27:01,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d57cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:27:01, skipping insertion in model container [2019-10-22 11:27:01,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:01" (3/3) ... [2019-10-22 11:27:01,901 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2019-10-22 11:27:01,910 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:27:01,931 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-22 11:27:01,947 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-22 11:27:01,968 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:27:01,969 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:27:01,969 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:27:01,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:27:01,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:27:01,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:27:01,969 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:27:01,969 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:27:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-10-22 11:27:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:27:01,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:01,989 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:01,993 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:01,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:01,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1479268755, now seen corresponding path program 1 times [2019-10-22 11:27:02,003 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:02,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022550181] [2019-10-22 11:27:02,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,004 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:02,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022550181] [2019-10-22 11:27:02,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:02,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:27:02,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642000698] [2019-10-22 11:27:02,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:27:02,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:02,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:27:02,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:02,126 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2019-10-22 11:27:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:02,250 INFO L93 Difference]: Finished difference Result 154 states and 201 transitions. [2019-10-22 11:27:02,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:27:02,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-22 11:27:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:02,261 INFO L225 Difference]: With dead ends: 154 [2019-10-22 11:27:02,264 INFO L226 Difference]: Without dead ends: 73 [2019-10-22 11:27:02,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:27:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-22 11:27:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2019-10-22 11:27:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-22 11:27:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-10-22 11:27:02,316 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 7 [2019-10-22 11:27:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:02,316 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-10-22 11:27:02,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:27:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-10-22 11:27:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:27:02,317 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:02,317 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:02,318 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1391586898, now seen corresponding path program 1 times [2019-10-22 11:27:02,318 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:02,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945654549] [2019-10-22 11:27:02,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:02,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945654549] [2019-10-22 11:27:02,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:02,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:02,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467018224] [2019-10-22 11:27:02,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:02,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:02,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:02,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:02,359 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 4 states. [2019-10-22 11:27:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:02,530 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2019-10-22 11:27:02,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:02,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:27:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:02,534 INFO L225 Difference]: With dead ends: 76 [2019-10-22 11:27:02,534 INFO L226 Difference]: Without dead ends: 72 [2019-10-22 11:27:02,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-22 11:27:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2019-10-22 11:27:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:27:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-10-22 11:27:02,548 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 8 [2019-10-22 11:27:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:02,548 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-10-22 11:27:02,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-10-22 11:27:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:27:02,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:02,549 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:02,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:02,549 INFO L82 PathProgramCache]: Analyzing trace with hash 57057392, now seen corresponding path program 1 times [2019-10-22 11:27:02,549 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:02,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193498371] [2019-10-22 11:27:02,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:02,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193498371] [2019-10-22 11:27:02,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:02,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:02,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546384220] [2019-10-22 11:27:02,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:02,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:02,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:02,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:02,589 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2019-10-22 11:27:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:02,687 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-10-22 11:27:02,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:02,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:27:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:02,688 INFO L225 Difference]: With dead ends: 69 [2019-10-22 11:27:02,688 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 11:27:02,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 11:27:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-10-22 11:27:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 11:27:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-10-22 11:27:02,696 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 9 [2019-10-22 11:27:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:02,696 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-10-22 11:27:02,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-10-22 11:27:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:27:02,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:02,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:02,697 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1711132744, now seen corresponding path program 1 times [2019-10-22 11:27:02,698 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:02,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414154185] [2019-10-22 11:27:02,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:02,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414154185] [2019-10-22 11:27:02,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:02,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:27:02,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894029769] [2019-10-22 11:27:02,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:27:02,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:02,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:27:02,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:02,756 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2019-10-22 11:27:02,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:02,863 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2019-10-22 11:27:02,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:27:02,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 11:27:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:02,865 INFO L225 Difference]: With dead ends: 61 [2019-10-22 11:27:02,865 INFO L226 Difference]: Without dead ends: 57 [2019-10-22 11:27:02,865 INFO L600 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-10-22 11:27:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-22 11:27:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-10-22 11:27:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 11:27:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-10-22 11:27:02,872 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2019-10-22 11:27:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:02,872 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-10-22 11:27:02,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:27:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-10-22 11:27:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:27:02,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:02,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:02,874 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:02,874 INFO L82 PathProgramCache]: Analyzing trace with hash 574068571, now seen corresponding path program 1 times [2019-10-22 11:27:02,874 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:02,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963309007] [2019-10-22 11:27:02,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:02,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:02,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963309007] [2019-10-22 11:27:02,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:02,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:02,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890278768] [2019-10-22 11:27:02,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:02,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:02,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:02,908 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2019-10-22 11:27:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:03,003 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-10-22 11:27:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:27:03,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-22 11:27:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:03,004 INFO L225 Difference]: With dead ends: 58 [2019-10-22 11:27:03,005 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:27:03,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:27:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-22 11:27:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:27:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-10-22 11:27:03,012 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 14 [2019-10-22 11:27:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:03,013 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-10-22 11:27:03,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-10-22 11:27:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:27:03,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:03,013 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:03,014 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -470786895, now seen corresponding path program 1 times [2019-10-22 11:27:03,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:03,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896165232] [2019-10-22 11:27:03,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:03,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:03,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:03,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896165232] [2019-10-22 11:27:03,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:03,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:27:03,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367097733] [2019-10-22 11:27:03,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:27:03,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:03,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:27:03,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:27:03,085 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-10-22 11:27:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:03,175 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-10-22 11:27:03,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:27:03,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-22 11:27:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:03,178 INFO L225 Difference]: With dead ends: 58 [2019-10-22 11:27:03,178 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 11:27:03,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:27:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 11:27:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-10-22 11:27:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:27:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-10-22 11:27:03,187 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2019-10-22 11:27:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:03,187 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-10-22 11:27:03,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:27:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-10-22 11:27:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:27:03,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:03,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:27:03,188 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1892453097, now seen corresponding path program 1 times [2019-10-22 11:27:03,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:27:03,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109990229] [2019-10-22 11:27:03,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:03,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:27:03,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:27:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:27:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:03,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109990229] [2019-10-22 11:27:03,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:27:03,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:27:03,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451189374] [2019-10-22 11:27:03,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:27:03,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:27:03,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:27:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:27:03,278 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2019-10-22 11:27:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:03,413 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2019-10-22 11:27:03,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:03,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:27:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:03,414 INFO L225 Difference]: With dead ends: 49 [2019-10-22 11:27:03,414 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:27:03,415 INFO L600 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-10-22 11:27:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:27:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:27:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:27:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:27:03,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-10-22 11:27:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:03,416 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:27:03,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:27:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:27:03,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:27:03,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:27:03,839 INFO L446 ceAbstractionStarter]: At program point L52(lines 10 53) the Hoare annotation is: true [2019-10-22 11:27:03,840 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:27:03,840 INFO L439 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-10-22 11:27:03,840 INFO L443 ceAbstractionStarter]: For program point L20-3(lines 20 51) no Hoare annotation was computed. [2019-10-22 11:27:03,840 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,840 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,840 INFO L439 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-10-22 11:27:03,840 INFO L443 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,841 INFO L439 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-10-22 11:27:03,841 INFO L443 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,841 INFO L439 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-10-22 11:27:03,841 INFO L443 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,841 INFO L439 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-10-22 11:27:03,841 INFO L443 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,842 INFO L439 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-10-22 11:27:03,842 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,842 INFO L443 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,842 INFO L439 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-10-22 11:27:03,842 INFO L439 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-10-22 11:27:03,843 INFO L443 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,843 INFO L439 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-10-22 11:27:03,843 INFO L443 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,843 INFO L439 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-10-22 11:27:03,843 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,843 INFO L443 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,844 INFO L439 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-10-22 11:27:03,845 INFO L443 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,845 INFO L439 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-10-22 11:27:03,845 INFO L443 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,845 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,845 INFO L443 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,845 INFO L439 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-10-22 11:27:03,845 INFO L443 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,845 INFO L443 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,845 INFO L443 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,846 INFO L443 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,846 INFO L439 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-10-22 11:27:03,846 INFO L443 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,846 INFO L443 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,846 INFO L443 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,846 INFO L443 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,846 INFO L439 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-10-22 11:27:03,846 INFO L443 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,847 INFO L443 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,847 INFO L443 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,847 INFO L443 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,847 INFO L439 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-10-22 11:27:03,847 INFO L443 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,847 INFO L443 ceAbstractionStarter]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,847 INFO L443 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,847 INFO L443 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,848 INFO L439 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-10-22 11:27:03,848 INFO L443 ceAbstractionStarter]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,848 INFO L443 ceAbstractionStarter]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:27:03,848 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 49) no Hoare annotation was computed. [2019-10-22 11:27:03,848 INFO L443 ceAbstractionStarter]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,848 INFO L439 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-10-22 11:27:03,848 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,848 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,848 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:27:03,848 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-22 11:27:03,849 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,849 INFO L439 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-10-22 11:27:03,849 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,849 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,849 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,849 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,849 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:27:03,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:27:03,851 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-22 11:27:03,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:27:03 BoogieIcfgContainer [2019-10-22 11:27:03,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:27:03,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:27:03,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:27:03,879 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:27:03,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:27:01" (3/4) ... [2019-10-22 11:27:03,883 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:27:03,894 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-10-22 11:27:03,894 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:27:03,951 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e5edeb93-e4e1-46f0-b90d-2a476774a362/bin/utaipan/witness.graphml [2019-10-22 11:27:03,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:27:03,953 INFO L168 Benchmark]: Toolchain (without parser) took 2713.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 951.2 MB in the beginning and 903.1 MB in the end (delta: 48.1 MB). Peak memory consumption was 217.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:03,953 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:03,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 951.2 MB in the beginning and 1.2 GB in the end (delta: -212.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:03,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:03,954 INFO L168 Benchmark]: Boogie Preprocessor took 25.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:03,955 INFO L168 Benchmark]: RCFGBuilder took 301.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:03,955 INFO L168 Benchmark]: TraceAbstraction took 1990.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.9 MB in the end (delta: 219.8 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:03,955 INFO L168 Benchmark]: Witness Printer took 72.38 ms. Allocated memory is still 1.2 GB. Free memory was 909.9 MB in the beginning and 903.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:03,957 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 951.2 MB in the beginning and 1.2 GB in the end (delta: -212.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 301.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1990.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.9 MB in the end (delta: 219.8 MB). Peak memory consumption was 219.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.38 ms. Allocated memory is still 1.2 GB. Free memory was 909.9 MB in the beginning and 903.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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, 75 locations, 16 error locations. Result: SAFE, OverallTime: 1.8s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 345 SDtfs, 310 SDslu, 149 SDs, 0 SdLazy, 338 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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, 431 HoareAnnotationTreeSize, 20 FomulaSimplifications, 3654 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 97 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s 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...