./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_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:27,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:07:27,572 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:07:27,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:07:27,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:07:27,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:07:27,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:07:27,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:07:27,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:07:27,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:07:27,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:07:27,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:07:27,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:07:27,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:07:27,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:07:27,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:07:27,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:07:27,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:07:27,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:07:27,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:07:27,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:07:27,594 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:07:27,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:07:27,596 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:07:27,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:07:27,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:07:27,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:07:27,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:07:27,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:07:27,599 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:07:27,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:07:27,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:07:27,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:07:27,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:07:27,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:07:27,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:07:27,602 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 17:07:27,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:07:27,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:07:27,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:07:27,612 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:07:27,613 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:07:27,613 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:07:27,613 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:07:27,613 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 17:07:27,613 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:07:27,613 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:07:27,614 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 17:07:27,614 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 17:07:27,614 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:07:27,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:07:27,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:07:27,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:07:27,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:07:27,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:07:27,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 17:07:27,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:07:27,615 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 17:07:27,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:07:27,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:07:27,616 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 17:07:27,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:07:27,616 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:07:27,616 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:07:27,616 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:07:27,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:07:27,617 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:07:27,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:07:27,617 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 17:07:27,617 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 17:07:27,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:07:27,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 17:07:27,618 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 17:07:27,618 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_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:27,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:07:27,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:07:27,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:07:27,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:07:27,649 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:07:27,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-02 17:07:27,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/data/1aca7a045/9becdb99cf5140e2a8d00c3aaabb2fa2/FLAG9432fea24 [2018-12-02 17:07:28,073 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:07:28,074 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-02 17:07:28,079 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/data/1aca7a045/9becdb99cf5140e2a8d00c3aaabb2fa2/FLAG9432fea24 [2018-12-02 17:07:28,446 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/data/1aca7a045/9becdb99cf5140e2a8d00c3aaabb2fa2 [2018-12-02 17:07:28,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:07:28,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:07:28,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:07:28,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:07:28,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:07:28,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e1e261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28, skipping insertion in model container [2018-12-02 17:07:28,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:07:28,477 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:07:28,591 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:07:28,593 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:07:28,622 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:07:28,631 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:07:28,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28 WrapperNode [2018-12-02 17:07:28,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:07:28,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:07:28,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:07:28,631 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:07:28,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:07:28,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:07:28,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:07:28,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:07:28,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... [2018-12-02 17:07:28,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:07:28,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:07:28,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:07:28,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:07:28,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:28,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 17:07:28,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 17:07:28,730 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-02 17:07:28,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-02 17:07:28,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:07:28,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:07:28,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 17:07:28,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 17:07:28,800 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 17:07:28,801 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 17:07:29,024 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:07:29,024 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 17:07:29,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:07:29 BoogieIcfgContainer [2018-12-02 17:07:29,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:07:29,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 17:07:29,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 17:07:29,027 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 17:07:29,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:07:28" (1/3) ... [2018-12-02 17:07:29,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497b215a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:07:29, skipping insertion in model container [2018-12-02 17:07:29,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:07:28" (2/3) ... [2018-12-02 17:07:29,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497b215a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:07:29, skipping insertion in model container [2018-12-02 17:07:29,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:07:29" (3/3) ... [2018-12-02 17:07:29,029 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-02 17:07:29,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 17:07:29,039 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 17:07:29,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 17:07:29,068 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 17:07:29,068 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 17:07:29,068 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 17:07:29,068 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:07:29,068 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:07:29,068 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 17:07:29,069 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:07:29,069 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 17:07:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-12-02 17:07:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 17:07:29,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:29,085 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-02 17:07:29,087 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:29,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2018-12-02 17:07:29,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:29,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:29,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:29,215 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-02 17:07:29,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:29,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:29,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:29,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:29,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:29,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:29,229 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2018-12-02 17:07:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:29,277 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2018-12-02 17:07:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:29,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 17:07:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:29,285 INFO L225 Difference]: With dead ends: 374 [2018-12-02 17:07:29,285 INFO L226 Difference]: Without dead ends: 218 [2018-12-02 17:07:29,287 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-02 17:07:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-02 17:07:29,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-12-02 17:07:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-02 17:07:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2018-12-02 17:07:29,318 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2018-12-02 17:07:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:29,318 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2018-12-02 17:07:29,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2018-12-02 17:07:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 17:07:29,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:29,319 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-02 17:07:29,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:29,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:29,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2018-12-02 17:07:29,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:29,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:29,352 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-02 17:07:29,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:29,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:29,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:29,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:29,353 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2018-12-02 17:07:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:29,444 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2018-12-02 17:07:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:29,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-02 17:07:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:29,445 INFO L225 Difference]: With dead ends: 466 [2018-12-02 17:07:29,445 INFO L226 Difference]: Without dead ends: 260 [2018-12-02 17:07:29,446 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-02 17:07:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-02 17:07:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2018-12-02 17:07:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-02 17:07:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2018-12-02 17:07:29,456 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2018-12-02 17:07:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:29,456 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2018-12-02 17:07:29,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2018-12-02 17:07:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 17:07:29,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:29,458 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-02 17:07:29,458 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:29,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2018-12-02 17:07:29,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:29,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:29,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:29,496 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-02 17:07:29,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:29,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:29,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:29,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:29,498 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2018-12-02 17:07:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:29,620 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2018-12-02 17:07:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:29,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-02 17:07:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:29,622 INFO L225 Difference]: With dead ends: 594 [2018-12-02 17:07:29,622 INFO L226 Difference]: Without dead ends: 352 [2018-12-02 17:07:29,623 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-02 17:07:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-12-02 17:07:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2018-12-02 17:07:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-02 17:07:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2018-12-02 17:07:29,639 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2018-12-02 17:07:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:29,640 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2018-12-02 17:07:29,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2018-12-02 17:07:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 17:07:29,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:29,642 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-02 17:07:29,643 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:29,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2018-12-02 17:07:29,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:29,685 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-02 17:07:29,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:29,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:29,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:29,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:29,686 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2018-12-02 17:07:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:29,755 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2018-12-02 17:07:29,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:29,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-02 17:07:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:29,756 INFO L225 Difference]: With dead ends: 702 [2018-12-02 17:07:29,756 INFO L226 Difference]: Without dead ends: 380 [2018-12-02 17:07:29,757 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-02 17:07:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-02 17:07:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2018-12-02 17:07:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-02 17:07:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2018-12-02 17:07:29,765 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2018-12-02 17:07:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:29,766 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2018-12-02 17:07:29,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2018-12-02 17:07:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 17:07:29,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:29,767 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-02 17:07:29,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:29,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2018-12-02 17:07:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:29,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:29,792 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-02 17:07:29,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:29,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:29,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:29,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:29,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:29,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:29,793 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2018-12-02 17:07:29,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:29,902 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2018-12-02 17:07:29,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:29,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-02 17:07:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:29,904 INFO L225 Difference]: With dead ends: 838 [2018-12-02 17:07:29,904 INFO L226 Difference]: Without dead ends: 476 [2018-12-02 17:07:29,905 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-02 17:07:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-12-02 17:07:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2018-12-02 17:07:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 17:07:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2018-12-02 17:07:29,915 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2018-12-02 17:07:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:29,915 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2018-12-02 17:07:29,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2018-12-02 17:07:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 17:07:29,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:29,917 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-02 17:07:29,917 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:29,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2018-12-02 17:07:29,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:29,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:29,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:29,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:29,940 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-02 17:07:29,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:29,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:29,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:29,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:29,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:29,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:29,941 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2018-12-02 17:07:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:30,009 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2018-12-02 17:07:30,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:30,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-02 17:07:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:30,011 INFO L225 Difference]: With dead ends: 936 [2018-12-02 17:07:30,011 INFO L226 Difference]: Without dead ends: 498 [2018-12-02 17:07:30,012 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-02 17:07:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-02 17:07:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2018-12-02 17:07:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-12-02 17:07:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2018-12-02 17:07:30,027 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2018-12-02 17:07:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:30,027 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2018-12-02 17:07:30,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2018-12-02 17:07:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 17:07:30,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:30,029 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-02 17:07:30,029 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:30,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2018-12-02 17:07:30,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:30,068 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-02 17:07:30,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:30,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:30,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:30,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:30,070 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2018-12-02 17:07:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:30,095 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2018-12-02 17:07:30,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:30,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-12-02 17:07:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:30,097 INFO L225 Difference]: With dead ends: 972 [2018-12-02 17:07:30,097 INFO L226 Difference]: Without dead ends: 731 [2018-12-02 17:07:30,098 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-02 17:07:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-02 17:07:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-02 17:07:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-02 17:07:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2018-12-02 17:07:30,110 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2018-12-02 17:07:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:30,111 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2018-12-02 17:07:30,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2018-12-02 17:07:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:07:30,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:30,112 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-02 17:07:30,112 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:30,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2018-12-02 17:07:30,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:30,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:30,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:30,162 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-02 17:07:30,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:30,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:30,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:30,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:30,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:30,163 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2018-12-02 17:07:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:30,191 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2018-12-02 17:07:30,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:30,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-02 17:07:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:30,194 INFO L225 Difference]: With dead ends: 972 [2018-12-02 17:07:30,194 INFO L226 Difference]: Without dead ends: 970 [2018-12-02 17:07:30,195 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-02 17:07:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-12-02 17:07:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2018-12-02 17:07:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-12-02 17:07:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2018-12-02 17:07:30,216 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2018-12-02 17:07:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:30,216 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2018-12-02 17:07:30,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2018-12-02 17:07:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 17:07:30,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:30,218 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-02 17:07:30,218 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:30,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2018-12-02 17:07:30,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:30,251 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-02 17:07:30,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:30,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:30,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:30,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:30,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:30,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:30,252 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2018-12-02 17:07:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:30,344 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2018-12-02 17:07:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:30,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-02 17:07:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:30,348 INFO L225 Difference]: With dead ends: 2034 [2018-12-02 17:07:30,349 INFO L226 Difference]: Without dead ends: 1076 [2018-12-02 17:07:30,350 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-02 17:07:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-12-02 17:07:30,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2018-12-02 17:07:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-12-02 17:07:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2018-12-02 17:07:30,368 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2018-12-02 17:07:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:30,368 INFO L480 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2018-12-02 17:07:30,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2018-12-02 17:07:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 17:07:30,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:30,370 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-02 17:07:30,370 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:30,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:30,371 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2018-12-02 17:07:30,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:30,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:30,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:30,396 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-02 17:07:30,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:30,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:30,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:30,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:30,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:30,397 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2018-12-02 17:07:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:30,492 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2018-12-02 17:07:30,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:30,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-12-02 17:07:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:30,495 INFO L225 Difference]: With dead ends: 2316 [2018-12-02 17:07:30,495 INFO L226 Difference]: Without dead ends: 1258 [2018-12-02 17:07:30,496 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-02 17:07:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-12-02 17:07:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2018-12-02 17:07:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-12-02 17:07:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2018-12-02 17:07:30,513 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2018-12-02 17:07:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:30,513 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2018-12-02 17:07:30,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2018-12-02 17:07:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-02 17:07:30,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:30,515 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-02 17:07:30,515 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:30,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2018-12-02 17:07:30,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:30,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:30,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:30,552 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-02 17:07:30,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:30,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:30,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:30,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:30,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:30,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:30,554 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2018-12-02 17:07:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:30,641 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2018-12-02 17:07:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:30,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-12-02 17:07:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:30,644 INFO L225 Difference]: With dead ends: 2544 [2018-12-02 17:07:30,645 INFO L226 Difference]: Without dead ends: 1338 [2018-12-02 17:07:30,646 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-02 17:07:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2018-12-02 17:07:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2018-12-02 17:07:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2018-12-02 17:07:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2018-12-02 17:07:30,663 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2018-12-02 17:07:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:30,664 INFO L480 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2018-12-02 17:07:30,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2018-12-02 17:07:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-02 17:07:30,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:30,666 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-02 17:07:30,666 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:30,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2018-12-02 17:07:30,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:30,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:30,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:30,702 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-02 17:07:30,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:30,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:30,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:30,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:30,702 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2018-12-02 17:07:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:30,802 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2018-12-02 17:07:30,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:30,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-12-02 17:07:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:30,805 INFO L225 Difference]: With dead ends: 2784 [2018-12-02 17:07:30,805 INFO L226 Difference]: Without dead ends: 1466 [2018-12-02 17:07:30,807 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-02 17:07:30,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-12-02 17:07:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2018-12-02 17:07:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-12-02 17:07:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2018-12-02 17:07:30,827 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2018-12-02 17:07:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:30,827 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2018-12-02 17:07:30,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2018-12-02 17:07:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 17:07:30,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:30,830 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-02 17:07:30,830 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:30,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2018-12-02 17:07:30,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:30,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:30,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:30,881 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-02 17:07:30,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:30,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:30,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:30,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:30,882 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2018-12-02 17:07:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:30,921 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2018-12-02 17:07:30,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:30,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-02 17:07:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:30,929 INFO L225 Difference]: With dead ends: 4334 [2018-12-02 17:07:30,929 INFO L226 Difference]: Without dead ends: 2892 [2018-12-02 17:07:30,932 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-02 17:07:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2018-12-02 17:07:30,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2018-12-02 17:07:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-02 17:07:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2018-12-02 17:07:30,984 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2018-12-02 17:07:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:30,984 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2018-12-02 17:07:30,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2018-12-02 17:07:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 17:07:30,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:30,987 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-02 17:07:30,987 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:30,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2018-12-02 17:07:30,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:30,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:30,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:30,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:31,038 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-02 17:07:31,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:31,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:31,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:31,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:31,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:31,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:31,039 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2018-12-02 17:07:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:31,136 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2018-12-02 17:07:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:31,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-02 17:07:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:31,142 INFO L225 Difference]: With dead ends: 6068 [2018-12-02 17:07:31,142 INFO L226 Difference]: Without dead ends: 3190 [2018-12-02 17:07:31,145 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-02 17:07:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2018-12-02 17:07:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2018-12-02 17:07:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2018-12-02 17:07:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2018-12-02 17:07:31,182 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2018-12-02 17:07:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:31,182 INFO L480 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2018-12-02 17:07:31,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2018-12-02 17:07:31,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-02 17:07:31,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:31,186 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-02 17:07:31,186 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:31,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2018-12-02 17:07:31,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:31,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:31,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:31,234 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-02 17:07:31,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:31,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:31,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:31,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:31,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:31,235 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2018-12-02 17:07:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:31,341 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2018-12-02 17:07:31,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:31,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-12-02 17:07:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:31,347 INFO L225 Difference]: With dead ends: 6484 [2018-12-02 17:07:31,347 INFO L226 Difference]: Without dead ends: 3322 [2018-12-02 17:07:31,350 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-02 17:07:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2018-12-02 17:07:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2018-12-02 17:07:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2018-12-02 17:07:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2018-12-02 17:07:31,386 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2018-12-02 17:07:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:31,387 INFO L480 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2018-12-02 17:07:31,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2018-12-02 17:07:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-12-02 17:07:31,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:31,390 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-02 17:07:31,390 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:31,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:31,391 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2018-12-02 17:07:31,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:31,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:31,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:31,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:31,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:31,435 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-02 17:07:31,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:31,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:31,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:31,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:31,436 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2018-12-02 17:07:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:31,538 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2018-12-02 17:07:31,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:31,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-12-02 17:07:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:31,544 INFO L225 Difference]: With dead ends: 7000 [2018-12-02 17:07:31,545 INFO L226 Difference]: Without dead ends: 3706 [2018-12-02 17:07:31,548 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-02 17:07:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2018-12-02 17:07:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2018-12-02 17:07:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2018-12-02 17:07:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2018-12-02 17:07:31,594 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2018-12-02 17:07:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:31,594 INFO L480 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2018-12-02 17:07:31,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2018-12-02 17:07:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-02 17:07:31,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:31,599 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-02 17:07:31,599 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:31,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2018-12-02 17:07:31,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:31,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:31,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:31,662 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-02 17:07:31,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:31,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:31,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:31,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:31,663 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2018-12-02 17:07:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:31,778 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2018-12-02 17:07:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:31,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-12-02 17:07:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:31,785 INFO L225 Difference]: With dead ends: 7632 [2018-12-02 17:07:31,785 INFO L226 Difference]: Without dead ends: 4026 [2018-12-02 17:07:31,788 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-02 17:07:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2018-12-02 17:07:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2018-12-02 17:07:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2018-12-02 17:07:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2018-12-02 17:07:31,827 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2018-12-02 17:07:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:31,828 INFO L480 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2018-12-02 17:07:31,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2018-12-02 17:07:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-02 17:07:31,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:31,832 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-02 17:07:31,832 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:31,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2018-12-02 17:07:31,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:31,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:31,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:31,886 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-02 17:07:31,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:31,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:31,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:31,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:31,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:31,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:31,887 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2018-12-02 17:07:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:31,935 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2018-12-02 17:07:31,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:31,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-12-02 17:07:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:31,946 INFO L225 Difference]: With dead ends: 10686 [2018-12-02 17:07:31,946 INFO L226 Difference]: Without dead ends: 6960 [2018-12-02 17:07:31,950 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-02 17:07:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2018-12-02 17:07:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2018-12-02 17:07:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2018-12-02 17:07:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2018-12-02 17:07:32,016 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2018-12-02 17:07:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:32,016 INFO L480 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2018-12-02 17:07:32,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2018-12-02 17:07:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-02 17:07:32,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:32,021 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-02 17:07:32,021 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:32,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2018-12-02 17:07:32,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:32,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:32,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:32,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:32,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:32,066 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-02 17:07:32,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:32,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:32,066 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:32,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:32,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:32,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:32,067 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2018-12-02 17:07:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:32,206 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2018-12-02 17:07:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:32,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-12-02 17:07:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:32,217 INFO L225 Difference]: With dead ends: 13912 [2018-12-02 17:07:32,217 INFO L226 Difference]: Without dead ends: 6966 [2018-12-02 17:07:32,225 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-02 17:07:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2018-12-02 17:07:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2018-12-02 17:07:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2018-12-02 17:07:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2018-12-02 17:07:32,295 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2018-12-02 17:07:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:32,296 INFO L480 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2018-12-02 17:07:32,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2018-12-02 17:07:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-02 17:07:32,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:32,301 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-02 17:07:32,301 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:32,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2018-12-02 17:07:32,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:32,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:32,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:32,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:32,367 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-02 17:07:32,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:32,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:07:32,368 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-12-02 17:07:32,370 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-02 17:07:32,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:07:32,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:07:32,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:07:32,673 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-02 17:07:32,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:32,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:07:32,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:32,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:32,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:32,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:07:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:32,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:32,812 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-02 17:07:32,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:07:32,877 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-02 17:07:32,903 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:07:32,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2018-12-02 17:07:32,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:32,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:07:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:07:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:07:32,904 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 4 states. [2018-12-02 17:07:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:33,117 INFO L93 Difference]: Finished difference Result 14034 states and 18379 transitions. [2018-12-02 17:07:33,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:07:33,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-12-02 17:07:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:33,126 INFO L225 Difference]: With dead ends: 14034 [2018-12-02 17:07:33,126 INFO L226 Difference]: Without dead ends: 7084 [2018-12-02 17:07:33,133 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-02 17:07:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7084 states. [2018-12-02 17:07:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7084 to 6940. [2018-12-02 17:07:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6940 states. [2018-12-02 17:07:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6940 states to 6940 states and 9085 transitions. [2018-12-02 17:07:33,257 INFO L78 Accepts]: Start accepts. Automaton has 6940 states and 9085 transitions. Word has length 284 [2018-12-02 17:07:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:33,258 INFO L480 AbstractCegarLoop]: Abstraction has 6940 states and 9085 transitions. [2018-12-02 17:07:33,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:07:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6940 states and 9085 transitions. [2018-12-02 17:07:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-12-02 17:07:33,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:33,263 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-02 17:07:33,263 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:33,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:33,263 INFO L82 PathProgramCache]: Analyzing trace with hash -39333344, now seen corresponding path program 1 times [2018-12-02 17:07:33,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:33,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:33,325 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-02 17:07:33,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:33,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:07:33,325 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-12-02 17:07:33,325 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-02 17:07:33,328 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:07:33,328 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:07:33,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:07:33,594 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-02 17:07:33,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:33,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:07:33,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:33,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:33,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:33,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:07:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:33,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:33,697 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-02 17:07:33,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:07:33,742 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-02 17:07:33,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:07:33,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 17:07:33,757 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:07:33,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:07:33,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:07:33,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:07:33,758 INFO L87 Difference]: Start difference. First operand 6940 states and 9085 transitions. Second operand 4 states. [2018-12-02 17:07:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:34,014 INFO L93 Difference]: Finished difference Result 13792 states and 18051 transitions. [2018-12-02 17:07:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:07:34,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2018-12-02 17:07:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:34,028 INFO L225 Difference]: With dead ends: 13792 [2018-12-02 17:07:34,029 INFO L226 Difference]: Without dead ends: 10410 [2018-12-02 17:07:34,035 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-02 17:07:34,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2018-12-02 17:07:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 8844. [2018-12-02 17:07:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2018-12-02 17:07:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11583 transitions. [2018-12-02 17:07:34,144 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11583 transitions. Word has length 297 [2018-12-02 17:07:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:34,144 INFO L480 AbstractCegarLoop]: Abstraction has 8844 states and 11583 transitions. [2018-12-02 17:07:34,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:07:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11583 transitions. [2018-12-02 17:07:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-12-02 17:07:34,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:34,151 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-02 17:07:34,151 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:34,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:34,151 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 2 times [2018-12-02 17:07:34,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:34,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:34,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:34,200 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-02 17:07:34,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:34,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:07:34,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 17:07:34,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 17:07:34,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:34,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:34,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:07:34,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 17:07:34,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-02 17:07:34,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:07:34,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:34,276 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-02 17:07:34,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:07:34,303 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-02 17:07:34,318 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:07:34,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 17:07:34,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:34,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:34,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:07:34,319 INFO L87 Difference]: Start difference. First operand 8844 states and 11583 transitions. Second operand 3 states. [2018-12-02 17:07:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:34,439 INFO L93 Difference]: Finished difference Result 18102 states and 23742 transitions. [2018-12-02 17:07:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:34,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2018-12-02 17:07:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:34,449 INFO L225 Difference]: With dead ends: 18102 [2018-12-02 17:07:34,449 INFO L226 Difference]: Without dead ends: 9276 [2018-12-02 17:07:34,456 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-02 17:07:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2018-12-02 17:07:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9204. [2018-12-02 17:07:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9204 states. [2018-12-02 17:07:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9204 states to 9204 states and 12063 transitions. [2018-12-02 17:07:34,541 INFO L78 Accepts]: Start accepts. Automaton has 9204 states and 12063 transitions. Word has length 310 [2018-12-02 17:07:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:34,542 INFO L480 AbstractCegarLoop]: Abstraction has 9204 states and 12063 transitions. [2018-12-02 17:07:34,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9204 states and 12063 transitions. [2018-12-02 17:07:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-12-02 17:07:34,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:34,548 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-02 17:07:34,548 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:34,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:34,548 INFO L82 PathProgramCache]: Analyzing trace with hash 670685447, now seen corresponding path program 1 times [2018-12-02 17:07:34,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:34,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:07:34,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:34,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:34,664 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-02 17:07:34,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:34,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:07:34,664 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 378 with the following transitions: [2018-12-02 17:07:34,664 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-02 17:07:34,666 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:07:34,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:07:34,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:07:34,937 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-02 17:07:34,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:34,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:07:34,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:34,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:34,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:34,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:07:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:35,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:35,063 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-02 17:07:35,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:07:35,126 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-02 17:07:35,142 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 17:07:35,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-02 17:07:35,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:35,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:07:35,142 INFO L87 Difference]: Start difference. First operand 9204 states and 12063 transitions. Second operand 3 states. [2018-12-02 17:07:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:35,246 INFO L93 Difference]: Finished difference Result 22958 states and 30072 transitions. [2018-12-02 17:07:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:35,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2018-12-02 17:07:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:35,258 INFO L225 Difference]: With dead ends: 22958 [2018-12-02 17:07:35,258 INFO L226 Difference]: Without dead ends: 13772 [2018-12-02 17:07:35,265 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-02 17:07:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13772 states. [2018-12-02 17:07:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13772 to 13772. [2018-12-02 17:07:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13772 states. [2018-12-02 17:07:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13772 states to 13772 states and 18009 transitions. [2018-12-02 17:07:35,386 INFO L78 Accepts]: Start accepts. Automaton has 13772 states and 18009 transitions. Word has length 377 [2018-12-02 17:07:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:35,386 INFO L480 AbstractCegarLoop]: Abstraction has 13772 states and 18009 transitions. [2018-12-02 17:07:35,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 13772 states and 18009 transitions. [2018-12-02 17:07:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-12-02 17:07:35,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:35,393 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-02 17:07:35,393 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:35,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2068327023, now seen corresponding path program 1 times [2018-12-02 17:07:35,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:35,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:35,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:35,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:35,496 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-02 17:07:35,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:35,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:07:35,496 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 380 with the following transitions: [2018-12-02 17:07:35,497 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-02 17:07:35,498 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:07:35,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:07:35,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:07:35,727 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-02 17:07:35,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:35,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:07:35,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:35,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:35,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:35,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:07:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:35,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:35,828 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-02 17:07:35,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:07:35,887 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-02 17:07:35,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:07:35,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 17:07:35,903 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:07:35,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:07:35,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:07:35,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:07:35,904 INFO L87 Difference]: Start difference. First operand 13772 states and 18009 transitions. Second operand 4 states. [2018-12-02 17:07:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:36,154 INFO L93 Difference]: Finished difference Result 30950 states and 40277 transitions. [2018-12-02 17:07:36,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:07:36,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2018-12-02 17:07:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:36,169 INFO L225 Difference]: With dead ends: 30950 [2018-12-02 17:07:36,169 INFO L226 Difference]: Without dead ends: 17184 [2018-12-02 17:07:36,179 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-02 17:07:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17184 states. [2018-12-02 17:07:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17184 to 14520. [2018-12-02 17:07:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14520 states. [2018-12-02 17:07:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14520 states to 14520 states and 18571 transitions. [2018-12-02 17:07:36,318 INFO L78 Accepts]: Start accepts. Automaton has 14520 states and 18571 transitions. Word has length 379 [2018-12-02 17:07:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:36,318 INFO L480 AbstractCegarLoop]: Abstraction has 14520 states and 18571 transitions. [2018-12-02 17:07:36,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:07:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 14520 states and 18571 transitions. [2018-12-02 17:07:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-12-02 17:07:36,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:36,326 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-02 17:07:36,326 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:36,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash -725462501, now seen corresponding path program 1 times [2018-12-02 17:07:36,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:36,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:36,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:36,451 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-02 17:07:36,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:07:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:07:36,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:07:36,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:07:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:07:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:07:36,452 INFO L87 Difference]: Start difference. First operand 14520 states and 18571 transitions. Second operand 3 states. [2018-12-02 17:07:36,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:36,661 INFO L93 Difference]: Finished difference Result 27597 states and 34926 transitions. [2018-12-02 17:07:36,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:07:36,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-12-02 17:07:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:36,666 INFO L225 Difference]: With dead ends: 27597 [2018-12-02 17:07:36,667 INFO L226 Difference]: Without dead ends: 5535 [2018-12-02 17:07:36,676 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-02 17:07:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2018-12-02 17:07:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5194. [2018-12-02 17:07:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2018-12-02 17:07:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 6445 transitions. [2018-12-02 17:07:36,720 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 6445 transitions. Word has length 418 [2018-12-02 17:07:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:36,720 INFO L480 AbstractCegarLoop]: Abstraction has 5194 states and 6445 transitions. [2018-12-02 17:07:36,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:07:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 6445 transitions. [2018-12-02 17:07:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-12-02 17:07:36,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:07:36,724 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-02 17:07:36,724 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:07:36,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2018-12-02 17:07:36,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:07:36,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:36,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:36,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:07:36,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:07:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:36,801 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-02 17:07:36,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:36,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 17:07:36,801 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2018-12-02 17:07:36,801 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-02 17:07:36,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 17:07:36,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 17:07:36,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 17:07:36,990 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-02 17:07:36,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:07:36,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 17:07:36,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:07:36,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/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-02 17:07:37,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:07:37,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 17:07:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:07:37,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:07:37,102 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-02 17:07:37,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 17:07:37,164 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-02 17:07:37,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 17:07:37,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-02 17:07:37,180 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 17:07:37,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:07:37,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:07:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:07:37,181 INFO L87 Difference]: Start difference. First operand 5194 states and 6445 transitions. Second operand 4 states. [2018-12-02 17:07:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:07:37,277 INFO L93 Difference]: Finished difference Result 5690 states and 7070 transitions. [2018-12-02 17:07:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:07:37,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2018-12-02 17:07:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:07:37,278 INFO L225 Difference]: With dead ends: 5690 [2018-12-02 17:07:37,278 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 17:07:37,282 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-02 17:07:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 17:07:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 17:07:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 17:07:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 17:07:37,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2018-12-02 17:07:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:07:37,283 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:07:37,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:07:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 17:07:37,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 17:07:37,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 17:07:37,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,757 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 88 [2018-12-02 17:07:37,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:37,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 17:07:38,081 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 19 [2018-12-02 17:07:38,449 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2018-12-02 17:07:38,586 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 17:07:38,586 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 17:07:38,586 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-12-02 17:07:38,586 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-12-02 17:07:38,586 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2018-12-02 17:07:38,586 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2018-12-02 17:07:38,586 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2018-12-02 17:07:38,586 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-02 17:07:38,587 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-02 17:07:38,587 INFO L451 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2018-12-02 17:07:38,587 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-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2018-12-02 17:07:38,587 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-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2018-12-02 17:07:38,587 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2018-12-02 17:07:38,588 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-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-12-02 17:07:38,588 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-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L444 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2018-12-02 17:07:38,588 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-12-02 17:07:38,589 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-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-02 17:07:38,589 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-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2018-12-02 17:07:38,589 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2018-12-02 17:07:38,589 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-02 17:07:38,589 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-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 200 481) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 200 481) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2018-12-02 17:07:38,590 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2018-12-02 17:07:38,591 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-02 17:07:38,591 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-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2018-12-02 17:07:38,591 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2018-12-02 17:07:38,591 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-02 17:07:38,592 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-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L448 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 17:07:38,592 INFO L451 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2018-12-02 17:07:38,593 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-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2018-12-02 17:07:38,593 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2018-12-02 17:07:38,594 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-02 17:07:38,594 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-02 17:07:38,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 17:07:38,594 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 17:07:38,594 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 17:07:38,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 17:07:38,594 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2018-12-02 17:07:38,594 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2018-12-02 17:07:38,594 INFO L451 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2018-12-02 17:07:38,594 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2018-12-02 17:07:38,594 INFO L448 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2018-12-02 17:07:38,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:07:38 BoogieIcfgContainer [2018-12-02 17:07:38,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 17:07:38,614 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:07:38,614 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:07:38,614 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:07:38,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:07:29" (3/4) ... [2018-12-02 17:07:38,618 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 17:07:38,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 17:07:38,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-02 17:07:38,623 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 17:07:38,629 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-02 17:07:38,630 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 17:07:38,630 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 17:07:38,655 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-02 17:07:38,655 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-02 17:07:38,655 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-02 17:07:38,655 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-02 17:07:38,656 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-02 17:07:38,656 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-02 17:07:38,656 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-02 17:07:38,656 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-02 17:07:38,656 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-02 17:07:38,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-02 17:07:38,657 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-02 17:07:38,657 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-02 17:07:38,657 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-02 17:07:38,657 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-02 17:07:38,657 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-02 17:07:38,658 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-02 17:07:38,658 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-02 17:07:38,699 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f93347b3-4111-4422-a88f-0316a7b4568a/bin-2019/utaipan/witness.graphml [2018-12-02 17:07:38,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:07:38,699 INFO L168 Benchmark]: Toolchain (without parser) took 10250.50 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 949.7 MB in the beginning and 1.7 GB in the end (delta: -785.5 MB). Peak memory consumption was 574.5 MB. Max. memory is 11.5 GB. [2018-12-02 17:07:38,700 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:07:38,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.36 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-02 17:07:38,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:07:38,700 INFO L168 Benchmark]: Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:07:38,700 INFO L168 Benchmark]: RCFGBuilder took 327.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2018-12-02 17:07:38,700 INFO L168 Benchmark]: TraceAbstraction took 9588.78 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -683.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-02 17:07:38,700 INFO L168 Benchmark]: Witness Printer took 84.80 ms. Allocated memory is still 2.4 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:07:38,701 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.36 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 43.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -167.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 327.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9588.78 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -683.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 84.80 ms. Allocated memory is still 2.4 GB. Free memory is still 1.7 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.2s 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.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 5371 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 505 NumberOfFragments, 750 HoareAnnotationTreeSize, 26 FomulaSimplifications, 40323 FormulaSimplificationTreeSizeReduction, 0.5s 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...