./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/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 a72fcebcfa7a668c9bb314320ec142761ff8c6a6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 13:02:53,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 13:02:53,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 13:02:53,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 13:02:53,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 13:02:53,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 13:02:53,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 13:02:53,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 13:02:53,569 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 13:02:53,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 13:02:53,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 13:02:53,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 13:02:53,571 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 13:02:53,572 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 13:02:53,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 13:02:53,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 13:02:53,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 13:02:53,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 13:02:53,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 13:02:53,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 13:02:53,578 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 13:02:53,579 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 13:02:53,581 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 13:02:53,581 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 13:02:53,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 13:02:53,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 13:02:53,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 13:02:53,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 13:02:53,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 13:02:53,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 13:02:53,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 13:02:53,585 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 13:02:53,585 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 13:02:53,585 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 13:02:53,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 13:02:53,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 13:02:53,586 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 13:02:53,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 13:02:53,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 13:02:53,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 13:02:53,597 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 13:02:53,597 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 13:02:53,598 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 13:02:53,598 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 13:02:53,598 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 13:02:53,598 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 13:02:53,598 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 13:02:53,598 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 13:02:53,598 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 13:02:53,598 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 13:02:53,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 13:02:53,599 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 13:02:53,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 13:02:53,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 13:02:53,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 13:02:53,599 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 13:02:53,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 13:02:53,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 13:02:53,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 13:02:53,600 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 13:02:53,600 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 13:02:53,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 13:02:53,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 13:02:53,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 13:02:53,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 13:02:53,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:02:53,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 13:02:53,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 13:02:53,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 13:02:53,601 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 13:02:53,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 13:02:53,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 13:02:53,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 13:02:53,601 INFO L133 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_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/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 -> a72fcebcfa7a668c9bb314320ec142761ff8c6a6 [2018-12-09 13:02:53,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 13:02:53,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 13:02:53,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 13:02:53,636 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 13:02:53,636 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 13:02:53,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-09 13:02:53,680 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/data/6d5786184/f4b3bfc40c264a9287c8cccf99d69a8f/FLAGd81b6b3e2 [2018-12-09 13:02:54,154 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 13:02:54,154 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-09 13:02:54,159 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/data/6d5786184/f4b3bfc40c264a9287c8cccf99d69a8f/FLAGd81b6b3e2 [2018-12-09 13:02:54,168 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/data/6d5786184/f4b3bfc40c264a9287c8cccf99d69a8f [2018-12-09 13:02:54,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 13:02:54,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 13:02:54,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 13:02:54,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 13:02:54,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 13:02:54,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3757d378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54, skipping insertion in model container [2018-12-09 13:02:54,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 13:02:54,197 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 13:02:54,310 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:02:54,313 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 13:02:54,342 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:02:54,350 INFO L195 MainTranslator]: Completed translation [2018-12-09 13:02:54,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54 WrapperNode [2018-12-09 13:02:54,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 13:02:54,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 13:02:54,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 13:02:54,351 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 13:02:54,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 13:02:54,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 13:02:54,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 13:02:54,397 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 13:02:54,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... [2018-12-09 13:02:54,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 13:02:54,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 13:02:54,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 13:02:54,428 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 13:02:54,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/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 [2018-12-09 13:02:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 13:02:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 13:02:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-09 13:02:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-09 13:02:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 13:02:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 13:02:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 13:02:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 13:02:54,544 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 13:02:54,544 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 13:02:54,768 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 13:02:54,768 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 13:02:54,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:02:54 BoogieIcfgContainer [2018-12-09 13:02:54,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 13:02:54,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 13:02:54,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 13:02:54,771 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 13:02:54,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:02:54" (1/3) ... [2018-12-09 13:02:54,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e25b49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:02:54, skipping insertion in model container [2018-12-09 13:02:54,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:02:54" (2/3) ... [2018-12-09 13:02:54,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e25b49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:02:54, skipping insertion in model container [2018-12-09 13:02:54,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:02:54" (3/3) ... [2018-12-09 13:02:54,774 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-09 13:02:54,783 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 13:02:54,789 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 13:02:54,803 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 13:02:54,829 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 13:02:54,829 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 13:02:54,829 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 13:02:54,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 13:02:54,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 13:02:54,829 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 13:02:54,830 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 13:02:54,830 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 13:02:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-12-09 13:02:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 13:02:54,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:54,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:54,848 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:54,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2018-12-09 13:02:54,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:54,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:54,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:02:54,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:54,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:54,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:54,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,006 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2018-12-09 13:02:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:55,052 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2018-12-09 13:02:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:55,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 13:02:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:55,061 INFO L225 Difference]: With dead ends: 374 [2018-12-09 13:02:55,061 INFO L226 Difference]: Without dead ends: 218 [2018-12-09 13:02:55,063 INFO L631 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 [2018-12-09 13:02:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-09 13:02:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-12-09 13:02:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-09 13:02:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2018-12-09 13:02:55,098 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2018-12-09 13:02:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:55,098 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2018-12-09 13:02:55,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2018-12-09 13:02:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 13:02:55,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:55,100 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:55,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:55,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:55,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2018-12-09 13:02:55,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:55,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:55,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:02:55,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:55,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:55,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:55,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,145 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2018-12-09 13:02:55,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:55,233 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2018-12-09 13:02:55,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:55,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-09 13:02:55,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:55,235 INFO L225 Difference]: With dead ends: 466 [2018-12-09 13:02:55,235 INFO L226 Difference]: Without dead ends: 260 [2018-12-09 13:02:55,236 INFO L631 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 [2018-12-09 13:02:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-09 13:02:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2018-12-09 13:02:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-09 13:02:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2018-12-09 13:02:55,246 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2018-12-09 13:02:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:55,247 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2018-12-09 13:02:55,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2018-12-09 13:02:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 13:02:55,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:55,248 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:55,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:55,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2018-12-09 13:02:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 13:02:55,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:55,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:55,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:55,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,284 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2018-12-09 13:02:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:55,387 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2018-12-09 13:02:55,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:55,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-09 13:02:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:55,388 INFO L225 Difference]: With dead ends: 594 [2018-12-09 13:02:55,388 INFO L226 Difference]: Without dead ends: 352 [2018-12-09 13:02:55,389 INFO L631 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 [2018-12-09 13:02:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-12-09 13:02:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2018-12-09 13:02:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-09 13:02:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2018-12-09 13:02:55,399 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2018-12-09 13:02:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:55,400 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2018-12-09 13:02:55,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2018-12-09 13:02:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 13:02:55,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:55,401 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:55,401 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:55,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2018-12-09 13:02:55,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:55,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:55,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 13:02:55,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:55,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:55,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:55,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,429 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2018-12-09 13:02:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:55,518 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2018-12-09 13:02:55,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:55,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-09 13:02:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:55,520 INFO L225 Difference]: With dead ends: 702 [2018-12-09 13:02:55,520 INFO L226 Difference]: Without dead ends: 380 [2018-12-09 13:02:55,521 INFO L631 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 [2018-12-09 13:02:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-09 13:02:55,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2018-12-09 13:02:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-09 13:02:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2018-12-09 13:02:55,529 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2018-12-09 13:02:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:55,529 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2018-12-09 13:02:55,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2018-12-09 13:02:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 13:02:55,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:55,531 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:55,531 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:55,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:55,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2018-12-09 13:02:55,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:55,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:55,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 13:02:55,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:55,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:55,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:55,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,558 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2018-12-09 13:02:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:55,665 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2018-12-09 13:02:55,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:55,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-09 13:02:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:55,667 INFO L225 Difference]: With dead ends: 838 [2018-12-09 13:02:55,667 INFO L226 Difference]: Without dead ends: 476 [2018-12-09 13:02:55,668 INFO L631 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 [2018-12-09 13:02:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-12-09 13:02:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2018-12-09 13:02:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-09 13:02:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2018-12-09 13:02:55,677 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2018-12-09 13:02:55,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:55,677 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2018-12-09 13:02:55,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2018-12-09 13:02:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 13:02:55,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:55,678 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:55,678 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:55,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2018-12-09 13:02:55,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:55,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:55,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 13:02:55,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:55,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:55,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:55,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,708 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2018-12-09 13:02:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:55,776 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2018-12-09 13:02:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:55,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-09 13:02:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:55,778 INFO L225 Difference]: With dead ends: 936 [2018-12-09 13:02:55,778 INFO L226 Difference]: Without dead ends: 498 [2018-12-09 13:02:55,779 INFO L631 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 [2018-12-09 13:02:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-09 13:02:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2018-12-09 13:02:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-12-09 13:02:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2018-12-09 13:02:55,788 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2018-12-09 13:02:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:55,789 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2018-12-09 13:02:55,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2018-12-09 13:02:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 13:02:55,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:55,790 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:55,790 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:55,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2018-12-09 13:02:55,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:55,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 13:02:55,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:55,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:55,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:55,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,820 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2018-12-09 13:02:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:55,848 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2018-12-09 13:02:55,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:55,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-12-09 13:02:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:55,850 INFO L225 Difference]: With dead ends: 972 [2018-12-09 13:02:55,851 INFO L226 Difference]: Without dead ends: 731 [2018-12-09 13:02:55,851 INFO L631 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 [2018-12-09 13:02:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-09 13:02:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-09 13:02:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-09 13:02:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2018-12-09 13:02:55,864 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2018-12-09 13:02:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:55,864 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2018-12-09 13:02:55,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2018-12-09 13:02:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 13:02:55,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:55,865 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:55,866 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:55,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2018-12-09 13:02:55,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:55,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:55,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-09 13:02:55,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:55,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:55,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:55,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,905 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2018-12-09 13:02:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:55,937 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2018-12-09 13:02:55,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:55,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 13:02:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:55,940 INFO L225 Difference]: With dead ends: 972 [2018-12-09 13:02:55,940 INFO L226 Difference]: Without dead ends: 970 [2018-12-09 13:02:55,940 INFO L631 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 [2018-12-09 13:02:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-12-09 13:02:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2018-12-09 13:02:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-12-09 13:02:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2018-12-09 13:02:55,953 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2018-12-09 13:02:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:55,953 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2018-12-09 13:02:55,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2018-12-09 13:02:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 13:02:55,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:55,955 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:55,955 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:55,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2018-12-09 13:02:55,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:55,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:55,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-09 13:02:55,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:55,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:55,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:55,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:55,982 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2018-12-09 13:02:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:56,066 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2018-12-09 13:02:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:56,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-09 13:02:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:56,068 INFO L225 Difference]: With dead ends: 2034 [2018-12-09 13:02:56,068 INFO L226 Difference]: Without dead ends: 1076 [2018-12-09 13:02:56,069 INFO L631 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 [2018-12-09 13:02:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-12-09 13:02:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2018-12-09 13:02:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-12-09 13:02:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2018-12-09 13:02:56,082 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2018-12-09 13:02:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:56,082 INFO L480 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2018-12-09 13:02:56,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2018-12-09 13:02:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 13:02:56,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:56,084 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:56,084 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:56,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2018-12-09 13:02:56,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:56,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:56,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-09 13:02:56,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:56,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:56,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:56,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:56,120 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2018-12-09 13:02:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:56,216 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2018-12-09 13:02:56,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:56,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-12-09 13:02:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:56,219 INFO L225 Difference]: With dead ends: 2316 [2018-12-09 13:02:56,219 INFO L226 Difference]: Without dead ends: 1258 [2018-12-09 13:02:56,220 INFO L631 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 [2018-12-09 13:02:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-12-09 13:02:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2018-12-09 13:02:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-12-09 13:02:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2018-12-09 13:02:56,237 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2018-12-09 13:02:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:56,237 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2018-12-09 13:02:56,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2018-12-09 13:02:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-09 13:02:56,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:56,239 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:56,239 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:56,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2018-12-09 13:02:56,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-09 13:02:56,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:56,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:56,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:56,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:56,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:56,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:56,274 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2018-12-09 13:02:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:56,351 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2018-12-09 13:02:56,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:56,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-12-09 13:02:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:56,354 INFO L225 Difference]: With dead ends: 2544 [2018-12-09 13:02:56,354 INFO L226 Difference]: Without dead ends: 1338 [2018-12-09 13:02:56,355 INFO L631 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 [2018-12-09 13:02:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2018-12-09 13:02:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2018-12-09 13:02:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2018-12-09 13:02:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2018-12-09 13:02:56,373 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2018-12-09 13:02:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:56,373 INFO L480 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2018-12-09 13:02:56,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2018-12-09 13:02:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-09 13:02:56,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:56,375 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:56,375 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:56,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2018-12-09 13:02:56,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:56,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:56,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-09 13:02:56,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:56,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:56,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:56,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:56,416 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2018-12-09 13:02:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:56,503 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2018-12-09 13:02:56,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:56,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-12-09 13:02:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:56,508 INFO L225 Difference]: With dead ends: 2784 [2018-12-09 13:02:56,508 INFO L226 Difference]: Without dead ends: 1466 [2018-12-09 13:02:56,510 INFO L631 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 [2018-12-09 13:02:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-12-09 13:02:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2018-12-09 13:02:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-12-09 13:02:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2018-12-09 13:02:56,545 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2018-12-09 13:02:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:56,545 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2018-12-09 13:02:56,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2018-12-09 13:02:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 13:02:56,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:56,550 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:56,550 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:56,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:56,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2018-12-09 13:02:56,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-12-09 13:02:56,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:56,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:56,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:56,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:56,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:56,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:56,620 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2018-12-09 13:02:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:56,650 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2018-12-09 13:02:56,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:56,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-09 13:02:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:56,658 INFO L225 Difference]: With dead ends: 4334 [2018-12-09 13:02:56,659 INFO L226 Difference]: Without dead ends: 2892 [2018-12-09 13:02:56,661 INFO L631 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 [2018-12-09 13:02:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2018-12-09 13:02:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2018-12-09 13:02:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-09 13:02:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2018-12-09 13:02:56,718 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2018-12-09 13:02:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:56,718 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2018-12-09 13:02:56,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2018-12-09 13:02:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-09 13:02:56,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:56,722 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:56,722 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:56,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:56,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2018-12-09 13:02:56,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:56,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:56,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-12-09 13:02:56,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:56,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:56,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:56,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:56,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:56,770 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2018-12-09 13:02:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:56,864 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2018-12-09 13:02:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:56,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-09 13:02:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:56,870 INFO L225 Difference]: With dead ends: 6068 [2018-12-09 13:02:56,870 INFO L226 Difference]: Without dead ends: 3190 [2018-12-09 13:02:56,873 INFO L631 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 [2018-12-09 13:02:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2018-12-09 13:02:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2018-12-09 13:02:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2018-12-09 13:02:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2018-12-09 13:02:56,910 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2018-12-09 13:02:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:56,911 INFO L480 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2018-12-09 13:02:56,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2018-12-09 13:02:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-09 13:02:56,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:56,914 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:56,915 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:56,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2018-12-09 13:02:56,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:56,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:56,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:56,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-09 13:02:56,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:56,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:56,955 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:56,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:56,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:56,956 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2018-12-09 13:02:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:57,049 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2018-12-09 13:02:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:57,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-12-09 13:02:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:57,055 INFO L225 Difference]: With dead ends: 6484 [2018-12-09 13:02:57,055 INFO L226 Difference]: Without dead ends: 3322 [2018-12-09 13:02:57,058 INFO L631 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 [2018-12-09 13:02:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2018-12-09 13:02:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2018-12-09 13:02:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2018-12-09 13:02:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2018-12-09 13:02:57,098 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2018-12-09 13:02:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:57,098 INFO L480 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2018-12-09 13:02:57,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2018-12-09 13:02:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-12-09 13:02:57,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:57,102 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:57,102 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:57,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2018-12-09 13:02:57,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:57,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:57,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:57,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:57,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-09 13:02:57,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:57,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:57,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:57,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:57,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:57,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:57,143 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2018-12-09 13:02:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:57,274 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2018-12-09 13:02:57,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:57,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-12-09 13:02:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:57,280 INFO L225 Difference]: With dead ends: 7000 [2018-12-09 13:02:57,280 INFO L226 Difference]: Without dead ends: 3706 [2018-12-09 13:02:57,284 INFO L631 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 [2018-12-09 13:02:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2018-12-09 13:02:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2018-12-09 13:02:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2018-12-09 13:02:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2018-12-09 13:02:57,336 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2018-12-09 13:02:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:57,336 INFO L480 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2018-12-09 13:02:57,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2018-12-09 13:02:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-09 13:02:57,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:57,352 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:57,352 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:57,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2018-12-09 13:02:57,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:57,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:57,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:57,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:57,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-09 13:02:57,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:57,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:57,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:57,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:57,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:57,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:57,402 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2018-12-09 13:02:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:57,530 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2018-12-09 13:02:57,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:57,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-12-09 13:02:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:57,538 INFO L225 Difference]: With dead ends: 7632 [2018-12-09 13:02:57,538 INFO L226 Difference]: Without dead ends: 4026 [2018-12-09 13:02:57,542 INFO L631 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 [2018-12-09 13:02:57,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2018-12-09 13:02:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2018-12-09 13:02:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2018-12-09 13:02:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2018-12-09 13:02:57,584 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2018-12-09 13:02:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:57,584 INFO L480 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2018-12-09 13:02:57,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2018-12-09 13:02:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-09 13:02:57,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:57,589 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:57,589 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:57,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:57,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2018-12-09 13:02:57,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:57,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:57,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:57,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:57,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-12-09 13:02:57,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:57,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:57,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:57,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:57,643 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2018-12-09 13:02:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:57,690 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2018-12-09 13:02:57,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:57,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-12-09 13:02:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:57,699 INFO L225 Difference]: With dead ends: 10686 [2018-12-09 13:02:57,699 INFO L226 Difference]: Without dead ends: 6960 [2018-12-09 13:02:57,703 INFO L631 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 [2018-12-09 13:02:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2018-12-09 13:02:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2018-12-09 13:02:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2018-12-09 13:02:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2018-12-09 13:02:57,771 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2018-12-09 13:02:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:57,771 INFO L480 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2018-12-09 13:02:57,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2018-12-09 13:02:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-09 13:02:57,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:57,776 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:57,777 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:57,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2018-12-09 13:02:57,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:57,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:57,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:57,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:57,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-12-09 13:02:57,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:02:57,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:02:57,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:57,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:02:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:02:57,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:02:57,822 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2018-12-09 13:02:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:57,968 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2018-12-09 13:02:57,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:02:57,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-12-09 13:02:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:57,981 INFO L225 Difference]: With dead ends: 13912 [2018-12-09 13:02:57,981 INFO L226 Difference]: Without dead ends: 6966 [2018-12-09 13:02:57,989 INFO L631 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 [2018-12-09 13:02:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2018-12-09 13:02:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2018-12-09 13:02:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2018-12-09 13:02:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2018-12-09 13:02:58,053 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2018-12-09 13:02:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:58,054 INFO L480 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2018-12-09 13:02:58,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:02:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2018-12-09 13:02:58,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-09 13:02:58,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:58,060 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:58,060 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:58,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2018-12-09 13:02:58,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:58,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:58,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:58,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:58,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-09 13:02:58,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:02:58,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:02:58,118 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-12-09 13:02:58,119 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [245], [248], [256], [259], [264], [267], [275], [280], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-09 13:02:58,147 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:02:58,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:02:58,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:02:58,507 INFO L272 AbstractInterpreter]: Visited 98 different actions 198 times. Merged at 72 different actions 88 times. Widened at 1 different actions 1 times. Performed 956 root evaluator evaluations with a maximum evaluation depth of 3. Performed 956 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 17 fixpoints after 13 different actions. Largest state had 102 variables. [2018-12-09 13:02:58,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:58,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:02:58,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:02:58,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:02:58,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:58,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:02:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:58,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:02:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2018-12-09 13:02:58,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:02:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2018-12-09 13:02:58,722 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 13:02:58,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2018-12-09 13:02:58,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:02:58,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:02:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:02:58,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 13:02:58,723 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 4 states. [2018-12-09 13:02:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:58,921 INFO L93 Difference]: Finished difference Result 14034 states and 18379 transitions. [2018-12-09 13:02:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 13:02:58,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-12-09 13:02:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:58,956 INFO L225 Difference]: With dead ends: 14034 [2018-12-09 13:02:58,957 INFO L226 Difference]: Without dead ends: 7084 [2018-12-09 13:02:58,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 13:02:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2018-12-09 13:02:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 6940. [2018-12-09 13:02:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6940 states. [2018-12-09 13:02:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6940 states to 6940 states and 9085 transitions. [2018-12-09 13:02:59,067 INFO L78 Accepts]: Start accepts. Automaton has 6940 states and 9085 transitions. Word has length 284 [2018-12-09 13:02:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:59,067 INFO L480 AbstractCegarLoop]: Abstraction has 6940 states and 9085 transitions. [2018-12-09 13:02:59,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:02:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6940 states and 9085 transitions. [2018-12-09 13:02:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-12-09 13:02:59,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:59,074 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:59,074 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:59,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:59,074 INFO L82 PathProgramCache]: Analyzing trace with hash -39333344, now seen corresponding path program 1 times [2018-12-09 13:02:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:59,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:59,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:59,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-09 13:02:59,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:02:59,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:02:59,128 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-12-09 13:02:59,128 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [275], [280], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-09 13:02:59,130 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:02:59,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:02:59,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:02:59,358 INFO L272 AbstractInterpreter]: Visited 107 different actions 300 times. Merged at 87 different actions 169 times. Never widened. Performed 1558 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1558 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 30 fixpoints after 15 different actions. Largest state had 104 variables. [2018-12-09 13:02:59,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:59,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:02:59,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:02:59,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:02:59,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:59,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:02:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:59,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:02:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-09 13:02:59,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:02:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-09 13:02:59,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:02:59,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-09 13:02:59,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:02:59,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:02:59,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:02:59,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:02:59,509 INFO L87 Difference]: Start difference. First operand 6940 states and 9085 transitions. Second operand 4 states. [2018-12-09 13:02:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:02:59,795 INFO L93 Difference]: Finished difference Result 13792 states and 18051 transitions. [2018-12-09 13:02:59,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 13:02:59,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2018-12-09 13:02:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:02:59,805 INFO L225 Difference]: With dead ends: 13792 [2018-12-09 13:02:59,806 INFO L226 Difference]: Without dead ends: 10410 [2018-12-09 13:02:59,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:02:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2018-12-09 13:02:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 8844. [2018-12-09 13:02:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2018-12-09 13:02:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11583 transitions. [2018-12-09 13:02:59,916 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11583 transitions. Word has length 297 [2018-12-09 13:02:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:02:59,917 INFO L480 AbstractCegarLoop]: Abstraction has 8844 states and 11583 transitions. [2018-12-09 13:02:59,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:02:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11583 transitions. [2018-12-09 13:02:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-12-09 13:02:59,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:02:59,925 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:02:59,925 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:02:59,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:02:59,925 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 2 times [2018-12-09 13:02:59,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:02:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:59,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:02:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:02:59,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:02:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:02:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-09 13:02:59,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:02:59,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:02:59,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 13:02:59,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 13:02:59,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:02:59,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:02:59,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 13:02:59,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 13:03:00,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 13:03:00,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:03:00,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:03:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2018-12-09 13:03:00,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:03:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2018-12-09 13:03:00,103 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 13:03:00,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-09 13:03:00,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:03:00,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:03:00,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:03:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:03:00,104 INFO L87 Difference]: Start difference. First operand 8844 states and 11583 transitions. Second operand 3 states. [2018-12-09 13:03:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:00,232 INFO L93 Difference]: Finished difference Result 18102 states and 23742 transitions. [2018-12-09 13:03:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:03:00,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2018-12-09 13:03:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:00,241 INFO L225 Difference]: With dead ends: 18102 [2018-12-09 13:03:00,241 INFO L226 Difference]: Without dead ends: 9276 [2018-12-09 13:03:00,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:03:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2018-12-09 13:03:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9204. [2018-12-09 13:03:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9204 states. [2018-12-09 13:03:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9204 states to 9204 states and 12063 transitions. [2018-12-09 13:03:00,354 INFO L78 Accepts]: Start accepts. Automaton has 9204 states and 12063 transitions. Word has length 310 [2018-12-09 13:03:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:00,355 INFO L480 AbstractCegarLoop]: Abstraction has 9204 states and 12063 transitions. [2018-12-09 13:03:00,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:03:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 9204 states and 12063 transitions. [2018-12-09 13:03:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-12-09 13:03:00,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:00,361 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:00,361 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:03:00,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:00,362 INFO L82 PathProgramCache]: Analyzing trace with hash 670685447, now seen corresponding path program 1 times [2018-12-09 13:03:00,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:03:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:00,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:03:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:00,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:03:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-09 13:03:00,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:00,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:03:00,515 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 378 with the following transitions: [2018-12-09 13:03:00,515 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [275], [280], [282], [286], [288], [291], [299], [301], [303], [306], [308], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-09 13:03:00,517 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:03:00,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:03:00,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:03:00,748 INFO L272 AbstractInterpreter]: Visited 111 different actions 331 times. Merged at 92 different actions 187 times. Widened at 1 different actions 1 times. Performed 1732 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1732 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 42 fixpoints after 19 different actions. Largest state had 104 variables. [2018-12-09 13:03:00,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:00,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:03:00,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:00,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:03:00,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:00,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:03:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:00,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:03:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2018-12-09 13:03:00,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:03:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2018-12-09 13:03:00,943 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 13:03:00,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-09 13:03:00,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:03:00,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:03:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:03:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:03:00,944 INFO L87 Difference]: Start difference. First operand 9204 states and 12063 transitions. Second operand 3 states. [2018-12-09 13:03:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:01,040 INFO L93 Difference]: Finished difference Result 22958 states and 30072 transitions. [2018-12-09 13:03:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:03:01,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2018-12-09 13:03:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:01,052 INFO L225 Difference]: With dead ends: 22958 [2018-12-09 13:03:01,053 INFO L226 Difference]: Without dead ends: 13772 [2018-12-09 13:03:01,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 13:03:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13772 states. [2018-12-09 13:03:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13772 to 13772. [2018-12-09 13:03:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13772 states. [2018-12-09 13:03:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13772 states to 13772 states and 18009 transitions. [2018-12-09 13:03:01,189 INFO L78 Accepts]: Start accepts. Automaton has 13772 states and 18009 transitions. Word has length 377 [2018-12-09 13:03:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:01,189 INFO L480 AbstractCegarLoop]: Abstraction has 13772 states and 18009 transitions. [2018-12-09 13:03:01,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:03:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 13772 states and 18009 transitions. [2018-12-09 13:03:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-12-09 13:03:01,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:01,197 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:01,197 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:03:01,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2068327023, now seen corresponding path program 1 times [2018-12-09 13:03:01,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:03:01,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:01,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:01,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:01,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:03:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-09 13:03:01,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:01,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:03:01,299 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 380 with the following transitions: [2018-12-09 13:03:01,299 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [275], [280], [282], [288], [291], [293], [299], [301], [303], [306], [308], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-09 13:03:01,301 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:03:01,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:03:01,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:03:01,536 INFO L272 AbstractInterpreter]: Visited 111 different actions 396 times. Merged at 87 different actions 241 times. Widened at 1 different actions 1 times. Performed 1933 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1933 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 51 fixpoints after 30 different actions. Largest state had 104 variables. [2018-12-09 13:03:01,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:01,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:03:01,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:01,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:03:01,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:01,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:03:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:01,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:03:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-09 13:03:01,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:03:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-12-09 13:03:01,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:03:01,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-09 13:03:01,757 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:03:01,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:03:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:03:01,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:03:01,758 INFO L87 Difference]: Start difference. First operand 13772 states and 18009 transitions. Second operand 4 states. [2018-12-09 13:03:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:02,048 INFO L93 Difference]: Finished difference Result 30950 states and 40277 transitions. [2018-12-09 13:03:02,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 13:03:02,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2018-12-09 13:03:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:02,062 INFO L225 Difference]: With dead ends: 30950 [2018-12-09 13:03:02,062 INFO L226 Difference]: Without dead ends: 17184 [2018-12-09 13:03:02,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:03:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17184 states. [2018-12-09 13:03:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17184 to 14520. [2018-12-09 13:03:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14520 states. [2018-12-09 13:03:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14520 states to 14520 states and 18571 transitions. [2018-12-09 13:03:02,252 INFO L78 Accepts]: Start accepts. Automaton has 14520 states and 18571 transitions. Word has length 379 [2018-12-09 13:03:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:02,253 INFO L480 AbstractCegarLoop]: Abstraction has 14520 states and 18571 transitions. [2018-12-09 13:03:02,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:03:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 14520 states and 18571 transitions. [2018-12-09 13:03:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-12-09 13:03:02,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:02,262 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:02,263 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:03:02,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash -725462501, now seen corresponding path program 1 times [2018-12-09 13:03:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:03:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:02,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:02,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:03:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-09 13:03:02,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:03:02,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 13:03:02,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:03:02,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 13:03:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 13:03:02,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 13:03:02,362 INFO L87 Difference]: Start difference. First operand 14520 states and 18571 transitions. Second operand 3 states. [2018-12-09 13:03:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:02,519 INFO L93 Difference]: Finished difference Result 27597 states and 34926 transitions. [2018-12-09 13:03:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 13:03:02,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-12-09 13:03:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:02,524 INFO L225 Difference]: With dead ends: 27597 [2018-12-09 13:03:02,524 INFO L226 Difference]: Without dead ends: 5535 [2018-12-09 13:03:02,538 INFO L631 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 [2018-12-09 13:03:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2018-12-09 13:03:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5194. [2018-12-09 13:03:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2018-12-09 13:03:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 6445 transitions. [2018-12-09 13:03:02,588 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 6445 transitions. Word has length 418 [2018-12-09 13:03:02,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:02,588 INFO L480 AbstractCegarLoop]: Abstraction has 5194 states and 6445 transitions. [2018-12-09 13:03:02,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 13:03:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 6445 transitions. [2018-12-09 13:03:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-12-09 13:03:02,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:03:02,592 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:03:02,592 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:03:02,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2018-12-09 13:03:02,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:03:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:02,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:03:02,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:03:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-12-09 13:03:02,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:02,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:03:02,663 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2018-12-09 13:03:02,663 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [275], [278], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-12-09 13:03:02,665 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:03:02,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:03:02,853 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:03:02,853 INFO L272 AbstractInterpreter]: Visited 113 different actions 318 times. Merged at 92 different actions 179 times. Never widened. Performed 1660 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1660 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 33 fixpoints after 16 different actions. Largest state had 105 variables. [2018-12-09 13:03:02,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:03:02,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:03:02,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:03:02,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:03:02,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:03:02,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:03:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:03:02,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:03:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-12-09 13:03:02,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:03:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-12-09 13:03:03,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:03:03,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-09 13:03:03,083 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:03:03,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 13:03:03,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 13:03:03,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 13:03:03,084 INFO L87 Difference]: Start difference. First operand 5194 states and 6445 transitions. Second operand 4 states. [2018-12-09 13:03:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:03:03,164 INFO L93 Difference]: Finished difference Result 5690 states and 7070 transitions. [2018-12-09 13:03:03,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 13:03:03,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2018-12-09 13:03:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:03:03,165 INFO L225 Difference]: With dead ends: 5690 [2018-12-09 13:03:03,165 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 13:03:03,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 13:03:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 13:03:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 13:03:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 13:03:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 13:03:03,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2018-12-09 13:03:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:03:03,170 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 13:03:03,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 13:03:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 13:03:03,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 13:03:03,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 13:03:03,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,540 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 88 [2018-12-09 13:03:03,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 13:03:03,854 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 19 [2018-12-09 13:03:04,193 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2018-12-09 13:03:04,324 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L444 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-12-09 13:03:04,325 INFO L451 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L444 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (<= ssl3_connect_~blastFlag~0 0) (and (<= ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ssl3_connect_~blastFlag~0 4) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (< |ssl3_connect_#in~initial_state| 12292))) [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2018-12-09 13:03:04,325 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L444 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L444 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-12-09 13:03:04,326 INFO L444 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_connect_~s__hit~0 0) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1) (< |ssl3_connect_#in~initial_state| 12292))) [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L444 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L444 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L444 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 3)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4528)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse6 (= ssl3_connect_~s__state~0 4512))) (or (and .cse0 .cse1) (and (= ssl3_connect_~s__state~0 4464) .cse2 .cse3) (and .cse4 .cse0 .cse5) (and .cse0 .cse2) (and .cse6 .cse2 .cse3) (and .cse5 .cse7 .cse2 .cse8 .cse3 .cse9) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse0 .cse7 .cse8) (and .cse5 .cse10 .cse11 .cse2 .cse3 .cse9) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4496) .cse2 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11) (and .cse0 (= ssl3_connect_~s__state~0 4384)) (and .cse4 .cse5 .cse3) (and (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse3) (< |ssl3_connect_#in~initial_state| 12292) (and .cse1 .cse3 .cse2) (and .cse0 .cse6))) [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2018-12-09 13:03:04,327 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L444 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_connect_~s__hit~0 0) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1))) [2018-12-09 13:03:04,328 INFO L444 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 200 481) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 200 481) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2018-12-09 13:03:04,328 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L444 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse3) (and .cse4 .cse0 .cse2))) [2018-12-09 13:03:04,329 INFO L444 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2018-12-09 13:03:04,329 INFO L444 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2) (and .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3 .cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4) .cse3 .cse4))) [2018-12-09 13:03:04,330 INFO L444 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1 .cse0 .cse2))) [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L451 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2018-12-09 13:03:04,330 INFO L444 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2018-12-09 13:03:04,330 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2018-12-09 13:03:04,330 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2018-12-09 13:03:04,331 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2018-12-09 13:03:04,331 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2018-12-09 13:03:04,331 INFO L444 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2018-12-09 13:03:04,331 INFO L444 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (<= 12292 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2018-12-09 13:03:04,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 13:03:04,331 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 13:03:04,331 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 13:03:04,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 13:03:04,331 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2018-12-09 13:03:04,331 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2018-12-09 13:03:04,331 INFO L451 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2018-12-09 13:03:04,331 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2018-12-09 13:03:04,331 INFO L448 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2018-12-09 13:03:04,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:03:04 BoogieIcfgContainer [2018-12-09 13:03:04,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 13:03:04,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 13:03:04,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 13:03:04,346 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 13:03:04,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:02:54" (3/4) ... [2018-12-09 13:03:04,348 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 13:03:04,352 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 13:03:04,352 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-09 13:03:04,353 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 13:03:04,357 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-09 13:03:04,358 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 13:03:04,358 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 13:03:04,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state)) || ((blastFlag <= 2 && 12292 <= s__state) && s__hit == 0)) || (((12292 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-12-09 13:03:04,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((blastFlag <= 0 || (blastFlag <= 2 && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || \old(initial_state) < 12292 [2018-12-09 13:03:04,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-09 13:03:04,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-12-09 13:03:04,376 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((blastFlag <= 2 && s__state == 4528) || ((s__state == 4464 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state == 4512 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state == 4480)) || ((s__state == 4496 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || \old(initial_state) < 12292) || ((s__state == 4528 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512) [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((256 == s__s3__tmp__new_cipher__algorithms && s__state <= 4560) && s__hit == 0) && 4464 <= s__state) [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) [2018-12-09 13:03:04,377 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state)) || \old(initial_state) < 12292 [2018-12-09 13:03:04,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) [2018-12-09 13:03:04,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0)) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) [2018-12-09 13:03:04,378 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(initial_state) < 12292 || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-12-09 13:03:04,408 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c834f54a-c187-4653-8c54-b4c94920a13e/bin-2019/utaipan/witness.graphml [2018-12-09 13:03:04,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 13:03:04,409 INFO L168 Benchmark]: Toolchain (without parser) took 10238.54 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 949.7 MB in the beginning and 1.4 GB in the end (delta: -455.1 MB). Peak memory consumption was 855.1 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:04,409 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:03:04,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.81 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:04,410 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:04,410 INFO L168 Benchmark]: Boogie Preprocessor took 30.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:03:04,410 INFO L168 Benchmark]: RCFGBuilder took 340.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:04,410 INFO L168 Benchmark]: TraceAbstraction took 9576.77 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -332.2 MB). Peak memory consumption was 844.3 MB. Max. memory is 11.5 GB. [2018-12-09 13:03:04,410 INFO L168 Benchmark]: Witness Printer took 63.12 ms. Allocated memory is still 2.3 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:03:04,411 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.81 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 340.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9576.77 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -332.2 MB). Peak memory consumption was 844.3 MB. Max. memory is 11.5 GB. * Witness Printer took 63.12 ms. Allocated memory is still 2.3 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((256 == s__s3__tmp__new_cipher__algorithms && s__state <= 4560) && s__hit == 0) && 4464 <= s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && s__state == 4528) || ((s__state == 4464 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state == 4512 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state == 4480)) || ((s__state == 4496 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || \old(initial_state) < 12292) || ((s__state == 4528 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((blastFlag <= 0 || (blastFlag <= 2 && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || \old(initial_state) < 12292 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((\old(initial_state) < 12292 || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state)) || ((blastFlag <= 2 && 12292 <= s__state) && s__hit == 0)) || (((12292 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0)) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state)) || \old(initial_state) < 12292 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 137 locations, 1 error locations. SAFE Result, 9.5s OverallTime, 26 OverallIterations, 18 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 5320 SDtfs, 1895 SDslu, 2986 SDs, 0 SdLazy, 2527 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4273 GetRequests, 4225 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14520occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 5371 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 505 NumberOfFragments, 750 HoareAnnotationTreeSize, 26 FomulaSimplifications, 40323 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 4464 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 7447 NumberOfCodeBlocks, 7179 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 9503 ConstructedInterpolants, 0 QuantifiedInterpolants, 4052247 SizeOfPredicates, 11 NumberOfNonLiveVariables, 3607 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 PerfectInterpolantSequences, 32257/32396 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...